V
- the vertex type; often Coord
public class DirectedGraph<V> extends Graph<V> implements java.io.Serializable
Graph
where all connections between vertices are one-way (but a connection may exist that goes from
A to B and another connection may go from B to A), and each connection can have a different cost.Constructor and Description |
---|
DirectedGraph() |
DirectedGraph(java.util.Collection<V> vertices) |
Modifier and Type | Method and Description |
---|---|
DirectedGraphAlgorithms<V> |
algorithms() |
protected Graph<V> |
createNew() |
protected Connection<V> |
obtainEdge() |
addConnection, addConnection, addEdge, addEdge, addVertex, addVertices, connectionExists, contains, edgeExists, getEdge, getEdge, getEdgeCount, getEdges, getEdges, getNode, getNodes, getVertices, isDirected, removeAllEdges, removeAllVertices, removeConnection, removeEdge, removeEdge, removeNode, removeVertex, removeVertices, size, sortEdges, sortVertices
public DirectedGraph()
public DirectedGraph(java.util.Collection<V> vertices)
protected Connection<V> obtainEdge()
obtainEdge
in class Graph<V>
public DirectedGraphAlgorithms<V> algorithms()
algorithms
in class Graph<V>
Copyright © Eben Howard 2012–2022. All rights reserved.