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