Qurak
Увійти

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Пошук у довіднику

Теми

Пов'язане

GraphDirectedGraphTreeGraphPathGraphConnectedGraphQLoopFreeGraphQTreeGraphQVertexDegreeAcyclicGraphQBipartiteGraphQEulerianGraphQHamiltonianGraphQ

Усі 6300 функцій · Використати з MCP-клієнта