Uses of Interface
org.amino.ds.graph.Graph

Packages that use Graph

org.amino.alg.graph	Interfaces and classes to implement a parallel graph algorithm.
org.amino.ds.graph	Interfaces and classes to implement a parallel graph data structure.

Uses of Graph in org.amino.alg.graph

Methods in org.amino.alg.graph that return Graph

static <E> Graph<E>

GraphAlg.getMST(UndirectedGraph graph, java.util.concurrent.ExecutorService pool) parallel MST algorithm based on Boruvka's algorithm.

Methods in org.amino.alg.graph with parameters of type Graph

static <E> double	GraphAlg.getShortestPath(Graph<E> graph, java.util.concurrent.ExecutorService exec, E source, E end) This is an implementation of a parallelization of Dijkstra's shortest path algorithm described by Crauser, Mehlhorn, Meyer and Sanders in their paper "A Parallelization of Dijkstra's Shortest Path Algorithm" in 23rd Symposium on Mathematical Foundations of Computer Science, 1998.
static <E> double	GraphAlg.getShortestPath(Graph<E> graph, java.util.concurrent.ExecutorService exec, Node<E> source, Node<E> end) This is an implementation of a parallelization of Dijkstra's shortest path algorithm described by Crauser, Mehlhorn, Meyer and Sanders in their paper "A Parallelization of Dijkstra's Shortest Path Algorithm" in 23rd Symposium on Mathematical Foundations of Computer Science, 1998.

Uses of Graph in org.amino.ds.graph

Subinterfaces of Graph in org.amino.ds.graph

interface

DirectedGraph<E> Interface of directed graph.

Classes in org.amino.ds.graph that implement Graph

class	AbstractGraph<E> Default implementation of Graph interface.
class	DirectedGraphImpl<E> Sample implementation of interface DirectedGraph.
class	UndirectedGraph<E> Undirected graph.

Methods in org.amino.ds.graph that return Graph

Graph<E>	Graph.clone() Clone this graph.
abstract Graph<E>	AbstractGraph.clone() Clone this graph.
Graph<E>	UndirectedGraph.clone() Clone this graph.
Graph<E>	DirectedGraphImpl.clone() Clone this graph.