Uses of Package
edu.upc.dama.dex.algorithms

Packages that use edu.upc.dama.dex.algorithms

edu.upc.dama.dex.algorithms

Provides classes in order to run algorithms among graphs.

Classes in edu.upc.dama.dex.algorithms used by edu.upc.dama.dex.algorithms

Algorithm
Common interface for all the algorithm implementations.

ConnectedComponents
This class contains the results processed on a Connectivity algorithm.

Connectivity
Any class implementing this abstract class can be used to solve a problem related to graph connectivity as finding the strongly connected components or finding the weakly connected components.

ShortestPath
Any class implementing this abstract class can be used to solve the single pair shortest path problem, single-source pair shortest path problem, single-destination shortest path problem or all-pairs shortest path problem.

SinglePairShortestPath
Any class implementing this abstract class can be used to solve the problem of finding a path between two nodes with the condition that the sum of the weights of the edges which belong to the path is minimized.

StrongConnectivity
Any class implementing this abstract class can be used to solve the problem of finding strongly connected components in a directed graph or in an undirected graph which will be considered as a directed one.

Traversal
Any class implementing this abstract class can be used to traverse a graph.

WeakConnectivity
Any class implementing this abstract class can be used to solve the problem of finding weakly connected components in an undirected graph or in a directed graph which will be considered as an undirected one.