FindSpanningTree

Tilgjengelig

Finds a minimum spanning tree of a graph using Kruskal's algorithm

Former

FindSpanningTree[{v1, v2, …, vn}]

FindSpanningTree[g]

FindSpanningTree[{g, v}, …]

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

Alternativer

DistanceFunction — default Automatic
Method — default Automatic

Søk i referansen

Emner

Discrete Mathematics - Trees & Expression Enumeration
Graph Modifications - Selecting Subgraphs
New In100 Alphabetical Listing - F
New In100 Graphs And Networks - Graphs & Networks
Spatial Point Collections - Spatial Graphs & Meshes
Summary Of New Features In143 - Graph Computation

Relatert

FindShortestTour FindHamiltonianPath FindShortestPath FindPath FindPostmanTour FindEulerianCycle DepthFirstScan BreadthFirstScan TreeGraph DominatorTreeGraph LinearOptimization NeighborhoodGraph

Alle 6300 funksjoner · Bruk dette fra en MCP-klient