Package dev.nm.graph
Interface DiGraph<V,E extends Arc<V>>
-
- Type Parameters:
V
- vertex typeE
- arc type
- All Superinterfaces:
Graph<V,E>
- All Known Subinterfaces:
DAGraph<V,E>
,RootedTree<V,E>
- All Known Implementing Classes:
SparseDAGraph
,SparseDiGraph
,SparseTree
,VertexTree
public interface DiGraph<V,E extends Arc<V>> extends Graph<V,E>
A directed graph or digraph is a graph, or set of nodes connected by edges, where the edges have a direction associated with them.- See Also:
- Wikipedia: Directed graph
-
-
Method Summary
All Methods Instance Methods Abstract Methods Modifier and Type Method Description Set<V>
children(V v)
Gets the set of all children of this vertex.Set<E>
incomingArcs(V v)
Gets the set of all incoming arcs associated with a vertex in this graph.Set<E>
outgoingArcs(V v)
Gets the set of all outgoing arcs associated with a vertex in this graph.Set<V>
parents(V v)
Gets the set of all parents of this vertex.-
Methods inherited from interface dev.nm.graph.Graph
addEdge, addVertex, edges, edges, removeEdge, removeVertex, vertices
-
-
-
-
Method Detail
-
outgoingArcs
Set<E> outgoingArcs(V v)
Gets the set of all outgoing arcs associated with a vertex in this graph.- Parameters:
v
- a vertex- Returns:
- all outgoing arcs associated with a vertex
-
incomingArcs
Set<E> incomingArcs(V v)
Gets the set of all incoming arcs associated with a vertex in this graph.- Parameters:
v
- a vertex- Returns:
- all incoming arcs associated with a vertex
-
parents
Set<V> parents(V v)
Gets the set of all parents of this vertex.- Parameters:
v
- a vertex- Returns:
- the set of all parents
-
-