GraphPower

Tersedia

Graph connecting vertices within a given distance

Bentuk

GraphPower[g, n]

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

Contoh disahkang = CycleGraph[7]; m = AdjacencyMatrix[g]; {GraphPower[g, 3], SimpleGraph[AdjacencyGraph[Clip[m + m.m + m.m.m]]]} → {Graph[<7>, <21>], SimpleGraph[Graph[<7>, <21>]]}

Jalankan ini di Qurak Cari dalam rujukan

Topik

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

Berkaitan

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

Semua 6300 fungsi · Gunakan ini daripada klien MCP