A B C D F G H I N P S T

A

APSPResult<N,E> - Interface in net.automatalib.algorithms.graph.apsp

Result interface for the all pairs shortest paths problem.

B

backtrackEdge(N, TarjanSCCRecord, E, N, TarjanSCCRecord) - Method in class net.automatalib.algorithms.graph.scc.TarjanSCCVisitor

C

collectSCCs(Graph<N, E>) - Static method in class net.automatalib.algorithms.graph.GraphAlgorithms

Collects all strongly-connected components in a graph.

collectSCCs(Graph<N, E>) - Static method in class net.automatalib.algorithms.graph.scc.SCCs

Collects all strongly-connected components in a graph.

D

DijkstraSSSP<N,E> - Class in net.automatalib.algorithms.graph.sssp

Implementation of Dijkstras algorithm for the single-source shortest path problem.

DijkstraSSSP(Graph<N, E>, N, EdgeWeights<E>) - Constructor for class net.automatalib.algorithms.graph.sssp.DijkstraSSSP

Constructor.

F

findAPSP(Graph<N, E>, EdgeWeights<E>) - Static method in class net.automatalib.algorithms.graph.apsp.FloydWarshallAPSP

findAPSP() - Method in class net.automatalib.algorithms.graph.apsp.FloydWarshallAPSP

findAPSP(Graph<N, E>, EdgeWeights<E>) - Static method in class net.automatalib.algorithms.graph.GraphAlgorithms

Computes the shortest paths between all pairs of nodes in a graph, using the Floyd-Warshall dynamic programming algorithm.

findSCCs(Graph<N, E>, SCCListener<N>) - Static method in class net.automatalib.algorithms.graph.GraphAlgorithms

Find all strongly-connected components in a graph.

findSCCs(Graph<N, E>, SCCListener<N>) - Static method in class net.automatalib.algorithms.graph.scc.SCCs

Find all strongly-connected components in a graph.

findSSSP(Graph<N, E>, N, EdgeWeights<E>) - Static method in class net.automatalib.algorithms.graph.GraphAlgorithms

Computes the shortest paths between a single source node and all other nodes in a graph, using Dijkstra's algorithm.

findSSSP(Graph<N, E>, N, EdgeWeights<E>) - Static method in class net.automatalib.algorithms.graph.sssp.DijkstraSSSP

Search for the shortest paths from a single source node in a graph.

findSSSP() - Method in class net.automatalib.algorithms.graph.sssp.DijkstraSSSP

Start the search.

finishExploration(N, TarjanSCCRecord) - Method in class net.automatalib.algorithms.graph.scc.TarjanSCCVisitor

FloydWarshallAPSP<N,E> - Class in net.automatalib.algorithms.graph.apsp

Implementation of the Floyd-Warshall dynamic programming algorithm for the all pairs shortest paths problem.

FloydWarshallAPSP(Graph<N, E>, EdgeWeights<E>) - Constructor for class net.automatalib.algorithms.graph.apsp.FloydWarshallAPSP

foundSCC(Collection<? extends N>) - Method in class net.automatalib.algorithms.graph.scc.SCCCollector

foundSCC(Collection<? extends N>) - Method in interface net.automatalib.algorithms.graph.scc.SCCListener

G

getInitialNode() - Method in class net.automatalib.algorithms.graph.sssp.DijkstraSSSP

getInitialNode() - Method in interface net.automatalib.algorithms.graph.sssp.SSSPResult

Retrieves the node the source was started from.

getSCCList() - Method in class net.automatalib.algorithms.graph.scc.SCCCollector

getShortestPath(N, N) - Method in interface net.automatalib.algorithms.graph.apsp.APSPResult

Retrieves the shortest path between the given nodes, or null if there exists no such path.

getShortestPath(N, N) - Method in class net.automatalib.algorithms.graph.apsp.FloydWarshallAPSP

getShortestPath(N) - Method in class net.automatalib.algorithms.graph.sssp.DijkstraSSSP

getShortestPath(N) - Method in interface net.automatalib.algorithms.graph.sssp.SSSPResult

Retrieves the shortest path from the initial node to the given one (as a sequence of edges), or null if there exists no such path.

getShortestPathDistance(N, N) - Method in interface net.automatalib.algorithms.graph.apsp.APSPResult

Retrieves the length of the shortest path between the given nodes.

getShortestPathDistance(N, N) - Method in class net.automatalib.algorithms.graph.apsp.FloydWarshallAPSP

getShortestPathDistance(N) - Method in class net.automatalib.algorithms.graph.sssp.DijkstraSSSP

getShortestPathDistance(N) - Method in interface net.automatalib.algorithms.graph.sssp.SSSPResult

Retrieves the length of the shortest path from the initial node to the given one.

getShortestPathEdge(N) - Method in class net.automatalib.algorithms.graph.sssp.DijkstraSSSP

getShortestPathEdge(N) - Method in interface net.automatalib.algorithms.graph.sssp.SSSPResult

Retrieves the incoming edge via which the given node is reached on the shortest path.

GraphAlgorithms - Class in net.automatalib.algorithms.graph

Convenience entry points and helper methods for various graph algorithms.

GraphAlgorithms() - Constructor for class net.automatalib.algorithms.graph.GraphAlgorithms

H

hasVisited(N) - Method in class net.automatalib.algorithms.graph.scc.TarjanSCCVisitor

I

INVALID_DISTANCE - Static variable in class net.automatalib.algorithms.graph.GraphAlgorithms

Float value to signal that no valid distance is returned (e.g., when attempting to retrieve the length of a path that does not exist).

N

net.automatalib.algorithms.graph - package net.automatalib.algorithms.graph

net.automatalib.algorithms.graph.apsp - package net.automatalib.algorithms.graph.apsp

net.automatalib.algorithms.graph.scc - package net.automatalib.algorithms.graph.scc

net.automatalib.algorithms.graph.sssp - package net.automatalib.algorithms.graph.sssp

P

processEdge(N, TarjanSCCRecord, E, N, Holder<TarjanSCCRecord>) - Method in class net.automatalib.algorithms.graph.scc.TarjanSCCVisitor

processInitial(N, Holder<TarjanSCCRecord>) - Method in class net.automatalib.algorithms.graph.scc.TarjanSCCVisitor

S

SCCCollector<N> - Class in net.automatalib.algorithms.graph.scc

SCCCollector() - Constructor for class net.automatalib.algorithms.graph.scc.SCCCollector

SCCListener<N> - Interface in net.automatalib.algorithms.graph.scc

SCCs - Class in net.automatalib.algorithms.graph.scc

Algorithms for finding strongly-connected components (SCCs) in a graph.

SSSPResult<N,E> - Interface in net.automatalib.algorithms.graph.sssp

Result interface for the single-source shortest path (SSSP) problem.

startExploration(N, TarjanSCCRecord) - Method in class net.automatalib.algorithms.graph.scc.TarjanSCCVisitor

T

TarjanSCCVisitor<N,E> - Class in net.automatalib.algorithms.graph.scc

Depth-first traversal visitor realizing Tarjan's algorithm for finding all strongly-connected components (SCCs) in a graph.

TarjanSCCVisitor(Graph<N, E>, SCCListener<N>) - Constructor for class net.automatalib.algorithms.graph.scc.TarjanSCCVisitor

Constructor.

toNodeList(List<E>, Graph<N, E>, N) - Static method in class net.automatalib.algorithms.graph.GraphAlgorithms

Converts a list of edges into a corresponding list of nodes.

A B C D F G H I N P S T