Qurak
Masuk

UndirectedGraph

Tersedia

`UndirectedGraph[g]` gives the graph with every edge undirected; the

UndirectedGraph[g]
UndirectedGraph[{v -> w, …}]
{EdgeCount[UndirectedGraph[Graph[{1 -> 2, 2 -> 1}]]], EdgeCount[UndirectedGraph[Graph[{1 -> 2, 2 -> 3}]]]} → {1, 2}{VertexList[UndirectedGraph[Graph[{1 -> 2}]]], UndirectedGraphQ[UndirectedGraph[Graph[{1 -> 2}]]]} → {{1, 2}, True}
Jalankan ini di QurakCari di referensi

Topik

Terkait

DirectedGraphSimpleGraphDirectedGraphQUndirectedGraphQIndexGraphReverseGraphEdgeAddEdgeDeleteEdgeTaggedGraphFindSpanningTreeGraphGraphComplement

Semua 6300 fungsi · Pakai ini dari klien MCP