Uses of Interface
rioko.grapht.Edge

Packages that use Edge

Package	Description
rioko.grapht
rioko.searchers
rioko.searchers.breadth

Uses of Edge in rioko.grapht

Classes in rioko.grapht with type parameters of type Edge

Modifier and Type	Class and Description
class	AdjacencyListGraph<V extends Vertex,E extends Edge<V>> Implementation of Graph structure using adjacency lists to store the edges of the graph.
interface	EdgeFactory<V extends Vertex,E extends Edge<V>> Factory interface to create Edge.
interface	Graph<V extends Vertex,E extends Edge<V>> Interface that gives the methods a Graph should implement to be a real Graph.

Classes in rioko.grapht that implement Edge

Modifier and Type	Class and Description
class	AbstractEdge<V extends Vertex> Abstract edge implementing the basic methods of the interface Edge.

Methods in rioko.grapht that return types with arguments of type Edge

Modifier and Type	Method and Description
EdgeFactory<V,? extends Edge<V>>	Edge.getEdgeFactory() Method to get the Factory class to create new Edges of the same class.

Uses of Edge in rioko.searchers

Methods in rioko.searchers with parameters of type Edge

Modifier and Type	Method and Description
protected abstract boolean	BreadthSearchIterator.isValidEdge(Edge<V> edge, V currentVertex) Abstract method to know if an edge is valid to explore in the breadth algorithm.

Constructor parameters in rioko.searchers with type arguments of type Edge

Constructor and Description
BreadthSearchIterator(AdjacencyListGraph<V,? extends Edge<V>> graph, V root)

Uses of Edge in rioko.searchers.breadth

Methods in rioko.searchers.breadth with parameters of type Edge

Modifier and Type	Method and Description
protected boolean	UndirectedSearchIterator.isValidEdge(Edge<V> edge, V currentVertex)
protected boolean	DirectedSearchIterator.isValidEdge(Edge<V> edge, V currentVertex)

Constructor parameters in rioko.searchers.breadth with type arguments of type Edge

Constructor and Description
DirectedSearchIterator(AdjacencyListGraph<V,? extends Edge<V>> graph, V root)
DirectedSearchIterator(AdjacencyListGraph<V,? extends Edge<V>> graph, V root, boolean searchAll)
UndirectedSearchIterator(AdjacencyListGraph<V,? extends Edge<V>> graph, V root)
UndirectedSearchIterator(AdjacencyListGraph<V,? extends Edge<V>> graph, V root, boolean searchAll)