Qurak
Connexion

PathGraphQ

Disponible

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}
Exécuter sur QurakRechercher dans la référence

Thèmes

Connexes

GraphDirectedGraphTreeGraphPathGraphConnectedGraphQLoopFreeGraphQTreeGraphQVertexDegreeAcyclicGraphQBipartiteGraphQEulerianGraphQHamiltonianGraphQ

Les 6300 fonctions · Utiliser ceci depuis un client MCP