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 客户端使用