UndirectedGraph

利用可能

`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}

Qurakで実行リファレンスを検索

トピック

Graph Modifications - Conversion of Graphs
New In80 Alphabetical Listing - U
Summary Of New Features In143 - Graph Computation
Summary Of New Features In143 - Graph Computation

関連

DirectedGraph SimpleGraph DirectedGraphQ UndirectedGraphQ IndexGraph ReverseGraph EdgeAdd EdgeDelete EdgeTaggedGraph FindSpanningTree Graph GraphComplement

全 6300 関数 · MCPクライアントから使う