Uses of Class
org.amino.ds.graph.Edge

Packages that use Edge

org.amino.ds.graph

Interfaces and classes to implement a parallel graph data structure.

Uses of Edge in org.amino.ds.graph

Methods in org.amino.ds.graph that return types with arguments of type Edge

java.util.Collection<Edge<E>>	AdjacentList.getEdge(E t) return all the edges whose one end has the value t in this adjacent list.
java.util.Collection<Edge<E>>	AdjacentList.getEdge(Node<E> n) return all the edge linked to node n.
java.util.Collection<Edge<E>>	Graph.getEdges(E start, E end) get all the edge start from the nodes which contain value start and end.
java.util.Collection<Edge<E>>	AbstractGraph.getEdges(E start, E end) get all the edge start from the nodes which contain value start and end.
java.util.Collection<Edge<E>>	Graph.getEdges(Node<E> start, Node<E> end) get all all the edges which start from node start and end with node end.
java.util.Collection<Edge<E>>	AbstractGraph.getEdges(Node<E> start, Node<E> end) get all all the edges which start from node start and end with node end.
java.util.Collection<Edge<E>>	DirectedGraph.getIncoming(Node<E> node) Get edges ended with end node.
java.util.Collection<Edge<E>>	DirectedGraphImpl.getIncoming(Node<E> node) Get edges ended with end node.
java.util.Collection<Edge<E>>	AdjacentList.getLinkedEdges() get all linked edges implied by this adjacent list.
java.util.Collection<Edge<E>>	Graph.getLinkedEdges(Node<E> node) get all edges directly linked to the specified node.
java.util.Collection<Edge<E>>	AbstractGraph.getLinkedEdges(Node<E> node) get all edges directly linked to the specified node.
java.util.Collection<Edge<E>>	DirectedGraph.getOutgoing(Node<E> node) Get edges started with start node.
java.util.Collection<Edge<E>>	DirectedGraphImpl.getOutgoing(Node<E> node) Get edges started with start node.

Methods in org.amino.ds.graph with parameters of type Edge

boolean	Graph.addEdge(Edge<E> edge) Add an edge to this graph.
boolean	UndirectedGraph.addEdge(Edge<E> edge) Add an edge to this graph.
boolean	AdjacentList.addEdge(Edge<E> e) add a specified edge into this adjacent list.
boolean	DirectedGraphImpl.addEdge(Edge<E> edge) Add an edge to this graph.
boolean	Graph.removeEdge(Edge<E> edge) remove all the edges which start from start and end to end.
boolean	UndirectedGraph.removeEdge(Edge<E> edge) remove all the edges which start from start and end to end.
boolean	AdjacentList.removeEdge(Edge<E> e) remove a specified edge from this adjacent list.
boolean	DirectedGraphImpl.removeEdge(Edge<E> edge) remove all the edges which start from start and end to end.