PathGraphQ

Disponibile

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)

Forme

PathGraphQ[g]

Esempi verificati{TreeGraphQ[g], PathGraphQ[g]} → {False, False}{ConnectedGraphQ[g], PathGraphQ[g]} → {False, False}{PathGraphQ[g] && AcyclicGraphQ[g], SimpleGraphQ[g]} → {False, False}

Esegui su Qurak Cerca nella guida

Argomenti

Graph Predicates - Global Structural Properties
Graph Properties And Measurements - Structural Properties
New In80 Alphabetical Listing - P

Correlate

Graph DirectedGraph TreeGraph PathGraph ConnectedGraphQ LoopFreeGraphQ TreeGraphQ VertexDegree AcyclicGraphQ BipartiteGraphQ EulerianGraphQ HamiltonianGraphQ

Tutte le 6300 funzioni · Usa questo da un client MCP