PathGraphQ

可用

Tests whether a graph is a simple connected graph with all degrees at most 2 (a digraph: at most one arc in and one out per vertex)

形式

PathGraphQ[g]

已驗證的範例{TreeGraphQ[g], PathGraphQ[g]} → {False, False}{ConnectedGraphQ[g], PathGraphQ[g]} → {False, False}{PathGraphQ[g] && AcyclicGraphQ[g], SimpleGraphQ[g]} → {False, False}

在 Qurak 上執行搜尋參考文件

主題

Graph Predicates - Global Structural Properties
Graph Properties And Measurements - Structural Properties
New In80 Alphabetical Listing - P

相關

Graph DirectedGraph TreeGraph PathGraph ConnectedGraphQ LoopFreeGraphQ TreeGraphQ VertexDegree AcyclicGraphQ BipartiteGraphQ EulerianGraphQ HamiltonianGraphQ

全部 6300 個函式 · 從 MCP 用戶端使用這個