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