Qurak
Войти

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Поиск по справочнику

Темы

Связанное

DirectedGraphSimpleGraphDirectedGraphQUndirectedGraphQIndexGraphReverseGraphEdgeAddEdgeDeleteEdgeTaggedGraphFindSpanningTreeGraphGraphComplement

Все 6300 функций · Использовать из MCP-клиента