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