implementation.dijkstra
Class Graph
java.lang.Object
implementation.dijkstra.Graph
public class Graph
- extends java.lang.Object
Constructor Summary |
|
Graph()
|
protected |
Graph(java.util.Set<java.lang.Integer> nodes,
java.util.List<implementation.dijkstra.Graph.Edge> edges)
|
Method Summary |
void |
addEdge(int start,
double cost,
int end)
|
void |
addNode(java.lang.Integer node)
|
void |
clear()
|
Graph |
copy()
|
java.lang.Double |
getCost(int start,
int end)
|
java.util.Set<java.lang.Integer> |
getNodes()
|
java.util.List<java.lang.Integer> |
predeccessors(java.lang.Integer node)
|
java.util.List<java.lang.Integer> |
successors(java.lang.Integer node)
|
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Graph
public Graph()
Graph
protected Graph(java.util.Set<java.lang.Integer> nodes,
java.util.List<implementation.dijkstra.Graph.Edge> edges)
addNode
public void addNode(java.lang.Integer node)
addEdge
public void addEdge(int start,
double cost,
int end)
clear
public void clear()
getCost
public java.lang.Double getCost(int start,
int end)
successors
public java.util.List<java.lang.Integer> successors(java.lang.Integer node)
predeccessors
public java.util.List<java.lang.Integer> predeccessors(java.lang.Integer node)
getNodes
public java.util.Set<java.lang.Integer> getNodes()
copy
public Graph copy()