ConnectedGraphQ

بەردەستە

Test whether a graph is connected (strongly connected for directed graphs)

شێوەکان

ConnectedGraphQ[g]

نموونە پشکنراوەکان{ConnectedGraphQ[g], Total[VertexDegree[g]] ≥ (VertexCount[g] - 1) / 2} → {False, Total[VertexDegree[g]] >= (-1 + VertexCount[g])/2}

ئەمە لەسەر Qurak جێبەجێ بکە لە سەرچاوەکەدا بگەڕێ

بابەتەکان

Graph Components - Connected Components
Graph Predicates - Global Structural Properties
Graph Properties And Measurements - Structural Properties
New In80 Alphabetical Listing - C
New In80 Mathematics And Algorithms - New Predicates and Properties »

پەیوەندیدار

ConnectedComponents ConnectedGraphComponents WeaklyConnectedGraphQ WeaklyConnectedComponents WeaklyConnectedGraphComponents Graph TreeGraph PathGraph TreeGraphQ PathGraphQ EulerianGraphQ AcyclicGraphQ

هەموو 6300 فەنکشنەکە · ئەمە لە کڵایەنتێکی MCP ەوە بەکاربهێنە