Uses of Class
com.whitestein.lsps.common.graph.Edge

Packages that use Edge

Package	Description
com.whitestein.lsps.common.graph

Uses of Edge in com.whitestein.lsps.common.graph

Methods in com.whitestein.lsps.common.graph that return types with arguments of type Edge

Modifier and Type	Method and Description
static <V> List<Edge<V>>	GraphUtils.acyclicTransitiveReduction(DirectedGraph<V> acyclicGraph) For a given acyclic graph this method returns a list of edges that can be removed to obtain a transitive reduction of the given graph.
Set<Edge<V>>	DirectedGraph.getEdges() Returns unmodifiable set of edges backed by this graph.
Set<Edge<V>>	DirectedGraph.getEdgesConnectedTo(V vertex) Returns edges with given vertex as source of target.
Set<Edge<V>>	DirectedGraph.getEdgesFrom(V vertex) Returns unmodifiable set of edges with given vertex as source backed by this graph.
Set<Edge<V>>	DirectedGraph.getEdgesTo(V vertex) Returns unmodifiable set of edges with given vertex as target backed by this graph.

Methods in com.whitestein.lsps.common.graph with parameters of type Edge

Modifier and Type	Method and Description
void	DirectedGraph.addEdge(Edge<V> edge) Adds given edge to this graph.
boolean	DirectedGraph.containsEdge(Edge<V> edge) Returns true if this graph contains given edge.
void	DirectedGraph.removeEdge(Edge<V> edge) Removes given edge from this graph.

Method parameters in com.whitestein.lsps.common.graph with type arguments of type Edge

Modifier and Type	Method and Description
void	DirectedGraph.addEdges(Collection<Edge<V>> edges) Adds a collection of edges to this graph.
void	DirectedGraph.removeEdges(Collection<Edge<V>> edges) Removes all given edges from this graph.

Constructor parameters in com.whitestein.lsps.common.graph with type arguments of type Edge

Constructor and Description
DirectedGraph(Collection<? extends V> vertices, Collection<Edge<V>> edges) Creates new instance of DirectedGraph with given vertices and edges.