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