Package | Description |
---|---|
com.raffaeleconforti.keithshwarz.algorithms.minimumspanningtree |
Modifier and Type | Method and Description |
---|---|
static <T> UndirectedGraphKruskal<T> |
Kruskal.mst(UndirectedGraphKruskal<T> graph)
Given an undirected graph with real-valued edge costs, returns a
spanning tree of that graph with minimum weight.
|
static <T> UndirectedGraphKruskal<T> |
Prim.mst(UndirectedGraphKruskal<T> graph)
Given a connected undirected graph with real-valued edge costs,
returns an MST of that graph.
|
Modifier and Type | Method and Description |
---|---|
static <T> UndirectedGraphKruskal<T> |
Kruskal.mst(UndirectedGraphKruskal<T> graph)
Given an undirected graph with real-valued edge costs, returns a
spanning tree of that graph with minimum weight.
|
static <T> UndirectedGraphKruskal<T> |
Prim.mst(UndirectedGraphKruskal<T> graph)
Given a connected undirected graph with real-valued edge costs,
returns an MST of that graph.
|