Qurak
登录

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 上运行搜索参考

主题

相关

GraphAdjacencyMatrixGraphComplementGraphDifferenceGraphIntersectionGraphUnionLineGraphDirectedGraphEdgeAddEdgeDeleteEdgeTaggedGraphFindSpanningTree

全部 6300 个函数 · 从 MCP 客户端使用