goldman.graph
Class WeightedAdjacencyMatrix<V,E extends WeightedEdge<V>>
java.lang.Object
goldman.graph.AbstractGraph<V,E>
goldman.graph.AbstractWeightedGraph<V,E>
goldman.graph.WeightedAdjacencyMatrix<V,E>
- All Implemented Interfaces:
- Graph<V,E>, WeightedGraph<V,E>, Iterable<V>
- Direct Known Subclasses:
- AbstractWeightedGraph.FlowGraph
public class WeightedAdjacencyMatrix<V,E extends WeightedEdge<V>>
- extends AbstractWeightedGraph<V,E>
The WeightedAdjacencyMatrix class provides an implementation for
a weighted adjacency matrix.
Methods inherited from class goldman.graph.AbstractGraph |
addEdge, addVertex, allowsMultiEdges, containsEdge, containsVertex, edgesFrom, edgesTo, getConnectedComponents, getCycle, getEdge, getStronglyConnectedComponents, hasCycle, isDirected, iterator, numConnectedComponents, numStronglyConnectedComponents, numVertices, removeEdge, removeVertex, topologicalOrder, toString, unweightedShortestPaths |
Methods inherited from interface goldman.graph.Graph |
addEdge, addVertex, allowsMultiEdges, containsEdge, containsVertex, edgesFrom, edgesTo, getConnectedComponents, getCycle, getEdge, getStronglyConnectedComponents, hasCycle, isDirected, iterator, numConnectedComponents, numStronglyConnectedComponents, numVertices, removeEdge, removeVertex, topologicalOrder, unweightedShortestPaths |
WeightedAdjacencyMatrix
public WeightedAdjacencyMatrix(boolean directed,
boolean multigraph)
WeightedAdjacencyMatrix
public WeightedAdjacencyMatrix()