Package y.algo

Provides efficient graph algorithms and network analysis tools.

See:
Description

Interface Summary

NodeSequencer

Generic Interface for classes that provide an ordering for the nodes of a graph.

Class Summary

Bfs	This class provides services that center around breadth first search (BFS)
Bipartitions	Resposible for graph bipartition problems.
Cycles	Reponsible for finding cycles within a graph that have certain properties.
Dfs	Framework class for depth first search (DFS) based algorithms.
GraphChecker	Provides methods that check structural properties of a given graph.
GraphConnectivity	Provides algorithms for determining certain connectivity components within a graph.
NetworkFlows	Provides sophisticated algorithms for solving classical network flow problems like MinCostFlow or MaxFlow.
NodeOrders	Provides graph algorithms that order the nodes of a graph by a specific criterion.
Paths	Reponsible for finding paths within a graph that have certain properties.
RankAssignments	Provides algorithms for solving the rank assignment problem.
ShortestPaths	Provides diverse algorithms and helper methods for solving the shortest path problem on weighted graphs.
Sorting	This class provides methods for efficiently sorting graph elements in graph structures.
SpanningTrees	Provides (minimum) spanning tree algorithms for graphs.
Transitivity	Provides algorithms to compute reachability information for directed, acyclic graphs: transitive closure transitive reduction
Trees	Provides diverse algorithms and services for tree-structured graphs or subgraphs.

Exception Summary

AlgorithmAbortedException

Exception that gets thrown by an algorithm when the thread executing the algorithm was interrupted.

Package y.algo Description

Provides efficient graph algorithms and network analysis tools.