Uses of Interface
com.jgalgo.alg.span.MinimumSpanningTree.Result

Packages that use MinimumSpanningTree.Result

Package	Description
com.jgalgo.alg.span	Algorithms for finding the minimum spanning trees and Steiner trees of graphs.

Uses of MinimumSpanningTree.Result in com.jgalgo.alg.span

Subinterfaces of MinimumSpanningTree.Result in com.jgalgo.alg.span

Modifier and Type	Interface	Description
static interface	MinimumSpanningTree.IResult	A result object for MinimumSpanningTree computation for IntGraph.

Methods in com.jgalgo.alg.span that return MinimumSpanningTree.Result

Modifier and Type	Method	Description
<V, E> MinimumSpanningTree.Result<V,E>	MinimumDirectedSpanningTree.computeMinimumDirectedSpanningTree(Graph<V,E> g, WeightFunction<E> w, V root)	Compute a minimum directed spanning tree (MDST) in a directed graph, rooted at the given vertex.
<V, E> MinimumSpanningTree.Result<V,E>	MinimumDirectedSpanningTreeAbstract.computeMinimumDirectedSpanningTree(Graph<V,E> g, WeightFunction<E> w, V root)
<V, E> MinimumSpanningTree.Result<V,E>	MinimumSpanningTree.computeMinimumSpanningTree(Graph<V,E> g, WeightFunction<E> w)	Compute the minimum spanning tree (MST) of a given graph.
<V, E> MinimumSpanningTree.Result<V,E>	MinimumSpanningTreeAbstract.computeMinimumSpanningTree(Graph<V,E> g, WeightFunction<E> w)