GraphPower

Доступно

Graph connecting vertices within a given distance

Форми

GraphPower[g, n]

GraphPower[{v -> w, …}, …]

Перевірені прикладиg = CycleGraph[7]; m = AdjacencyMatrix[g]; {GraphPower[g, 3], SimpleGraph[AdjacencyGraph[Clip[m + m.m + m.m.m]]]} → {Graph[<7>, <21>], SimpleGraph[Graph[<7>, <21>]]}

Виконати на Qurak Пошук у довіднику

Теми

Graph Modifications - Operations on Graphs
New In80 Alphabetical Listing - G
Summary Of New Features In143 - Graph Computation
Summary Of New Features In143 - Graph Computation

Пов'язане

Graph AdjacencyMatrix GraphComplement GraphDifference GraphIntersection GraphUnion LineGraph DirectedGraph EdgeAdd EdgeDelete EdgeTaggedGraph FindSpanningTree

Усі 6300 функцій · Використати з MCP-клієнта