WeaklyConnectedGraphQ

Tersedia

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

Bentuk

WeaklyConnectedGraphQ[g]

Contoh terverifikasiWeaklyConnectedGraphQ[Graph[{1 -> 2, 2 -> 3}]] → True WeaklyConnectedGraphQ[Graph[{1 -> 2, 3 -> 4}]] → False

Jalankan ini di Qurak Cari di referensi

Topik

Terkait

WeaklyConnectedComponents WeaklyConnectedGraphComponents ConnectedGraphQ ConnectedComponents ConnectedGraphComponents AdjacencyList EdgeAdd EdgeConnectivity EdgeCount EdgeDelete EdgeIndex EdgeList

Semua 6300 fungsi · Pakai ini dari klien MCP