Uses of Interface
com.jgalgo.alg.dag.TopologicalOrderAlgo.Result
Packages that use TopologicalOrderAlgo.Result
Package
Description
Algorithms specifically designed for directed acyclic graphs (DAGs).
-
Uses of TopologicalOrderAlgo.Result in com.jgalgo.alg.dag
Subinterfaces of TopologicalOrderAlgo.Result in com.jgalgo.alg.dagModifier and TypeInterfaceDescriptionstatic interface
A result object of aTopologicalOrderAlgo
algorithm forIntGraph
.Methods in com.jgalgo.alg.dag that return TopologicalOrderAlgo.ResultModifier and TypeMethodDescriptiondefault <V,
E> TopologicalOrderAlgo.Result <V, E> TopologicalOrderAlgo.computeTopologicalSorting
(Graph<V, E> g) Compute the topological order of the vertices in a DAG graph.Methods in com.jgalgo.alg.dag that return types with arguments of type TopologicalOrderAlgo.ResultModifier and TypeMethodDescription<V,
E> Optional <TopologicalOrderAlgo.Result<V, E>> TopologicalOrderAlgo.computeTopologicalSortingIfExist
(Graph<V, E> g) Compute the topological order of the vertices, if the graph is DAG.<V,
E> Optional <TopologicalOrderAlgo.Result<V, E>> TopologicalOrderAlgoAbstract.computeTopologicalSortingIfExist
(Graph<V, E> g)