Uses of Interface
edu.upc.dama.dex.algorithms.Algorithm

Packages that use Algorithm

edu.upc.dama.dex.algorithms

Provides classes in order to run algorithms among graphs.

Uses of Algorithm in edu.upc.dama.dex.algorithms

Classes in edu.upc.dama.dex.algorithms that implement Algorithm

class	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.
class	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.
class	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.
class	SinglePairShortestPathBFS This class can be used to solve the single-pair shortest path problem in an unweighted graph.
class	SinglePairShortestPathDijkstra This class can be used to solve the single-pair shortest path problem in a weighted graph.
class	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.
class	StrongConnectivityGabow This class can be used to solve the problem of finding strongly connected components in a directed graph.
class	Traversal Any class implementing this abstract class can be used to traverse a graph.
class	TraversalBFS This class can be used to traverse the graph using the breadth-first search algorithm (BFS).
class	TraversalDFS This class can be used to traverse the graph using the depth-first search algorithm (DFS).
class	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.
class	WeakConnectivityDFS This 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.