|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
public interface SPNode
A Node for a shortest path graph. This is essentially an object that weighted connections to other objects.
ShortestPathFinder| Method Summary | |
|---|---|
void |
addNextHop(SPNode n,
SPVertex v)
Add a vertex to the next hop database to take you to a particular location. |
void |
clearNextHops()
Clear out the next hop map. |
boolean |
equals(java.lang.Object o)
Object.equals must be overridden to return results consistent to compareTo(other). |
java.util.SortedSet |
getConnections()
Get all of the connections to other nodes. |
SPVertex |
getNextHop(SPNode n)
Get the next hop to take you to the given node. |
java.util.Map |
getNextHops()
Get the mapping of SPNode -> SPVertex hops for this SPNode. |
int |
hashCode()
Object.hashCode must be overridden to return a consistent hashCode. |
| Methods inherited from interface java.lang.Comparable |
|---|
compareTo |
| Method Detail |
|---|
java.util.SortedSet getConnections()
SPVertex objects.java.util.Map getNextHops()
void clearNextHops()
ShortestPathFinder.
SPVertex getNextHop(SPNode n)
n - the node you want to get to
void addNextHop(SPNode n,
SPVertex v)
ShortestPathFinder.
n - the destination nodev - the vertex that will take you thereint hashCode()
one.compareTo(other) == one.equals(other) == true
must return the same hashCode.
hashCode in class java.lang.Objectboolean equals(java.lang.Object o)
equals in class java.lang.Objecto - the object to which to compare
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||