Qurak
साइन इन

WeaklyConnectedGraphQ

उपलब्ध

Tests whether a directed graph is weakly connected — that is, whether its

WeaklyConnectedGraphQ[g]
WeaklyConnectedGraphQ[Graph[{1 -> 2, 2 -> 3}]] → TrueWeaklyConnectedGraphQ[Graph[{1 -> 2, 3 -> 4}]] → False
इसे Qurak पर चलाएँसंदर्भ में खोजें

विषय

संबंधित

WeaklyConnectedComponentsWeaklyConnectedGraphComponentsConnectedGraphQConnectedComponentsConnectedGraphComponentsAdjacencyListEdgeAddEdgeConnectivityEdgeCountEdgeDeleteEdgeIndexEdgeList

सभी 6300 फ़ंक्शन · इसे किसी MCP क्लाइंट से उपयोग करें