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 क्लाइंट से उपयोग करें