Package org.mpi_sws.jmc.strategies.trust

Class ExecutionGraph.TopologicalSorter

java.lang.Object

org.mpi_sws.jmc.strategies.trust.ExecutionGraph.TopologicalSorter

Enclosing class:

ExecutionGraph

public static class ExecutionGraph.TopologicalSorter
extends Object

Topological sorter for the execution graph.

Sorts the nodes in topological order and throws an exception if the graph has cycles.

Nested Class Summary

Nested Classes

Modifier and Type	Class	Description
static class	ExecutionGraph.TopologicalSorter.GraphCycleException	Exception thrown when the graph has cycles.

Constructor Summary

Constructors

Constructor	Description
TopologicalSorter(ExecutionGraph graph)	Initializes a new topological sorter for the given graph.

Method Summary

Modifier and Type	Method	Description
List<ExecutionGraphNode>	sort()	Sorts the graph in topological order.
void	sortWithVisitor(ExecutionGraph.ExecutionGraphNodeVisitor visitor)	Sorts the graph in topological order and visits each node using the given visitor.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

TopologicalSorter

public TopologicalSorter(ExecutionGraph graph)

Initializes a new topological sorter for the given graph.

Parameters:

graph - The graph to sort.

Method Details

sort

public List<ExecutionGraphNode> sort()
                              throws ExecutionGraph.TopologicalSorter.GraphCycleException

Sorts the graph in topological order.

Returns:

The sorted list of nodes.

Throws:

ExecutionGraph.TopologicalSorter.GraphCycleException - If the graph has cycles.

sortWithVisitor

public void sortWithVisitor(ExecutionGraph.ExecutionGraphNodeVisitor visitor)
                     throws ExecutionGraph.TopologicalSorter.GraphCycleException

Sorts the graph in topological order and visits each node using the given visitor.

Parameters:

visitor - The visitor to use for each node.

Throws:

ExecutionGraph.TopologicalSorter.GraphCycleException - If the graph has cycles.