# pgRouting Manual (3.3)

## Spanning Tree - Category

- Supported versions: Latest (3.3) 3.2 3.1 3.0

# Spanning Tree - Category

- Kruskal - Family of functions

- Prim - Family of functions

A spanning tree of an undirected graph is a tree that includes all the vertices of G with the minimum possible number of edges.

For a disconnected graph, there there is no single tree, but a spanning forest, consisting of a spanning tree of each connected component.

## See Also

- Boost: Prim’s algorithm documentation

- Wikipedia: Prim’s algorithm

Indices and tables

- Index

- Search Page