|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object | +--drasys.or.graph.PropertiesAdapter
A convenience object that provides default vertex properties.
Constructor Summary | |
PropertiesAdapter()
|
Method Summary | |
double |
getConnectionCost(EdgeI inEdge,
VertexI vertex,
EdgeI outEdge)
Always returns zero. |
double |
getConnectionTime(EdgeI inEdge,
VertexI vertex,
EdgeI outEdge)
Always returns zero. |
double |
getEdgeCost(EdgeI edge,
boolean isReverse)
Always returns 'edge.getCost(isReverse)'. |
double |
getEdgeDistance(EdgeI edge,
boolean isReverse)
Always returns 'edge.getDistance(isReverse)'. |
double |
getEdgeTime(EdgeI edge,
boolean isReverse)
Always returns 'edge.getTime(isReverse)'. |
double |
getVertexCost(VertexI vertex)
Always returns 'vertex.getTime()'. |
double[] |
getVertexDemand(VertexI vertex)
Always returns 'vertex.getDemand()'. |
double |
getVertexTime(VertexI vertex)
Always returns 'vertex.getCost()'. |
boolean |
isConnectionRestricted(EdgeI inEdge,
VertexI vertex,
EdgeI outEdge)
Always returns false. |
boolean |
isEdgeRestricted(EdgeI edge,
boolean reverse)
Always returns false |
boolean |
isSymmetric()
Always returns true; |
boolean |
isVertexRestricted(VertexI vertex)
Always returns false. |
Methods inherited from class java.lang.Object |
clone,
equals,
finalize,
getClass,
hashCode,
notify,
notifyAll,
toString,
wait,
wait,
wait |
Constructor Detail |
public PropertiesAdapter()
Method Detail |
public boolean isVertexRestricted(VertexI vertex)
public double getVertexCost(VertexI vertex)
public double getVertexTime(VertexI vertex)
public double[] getVertexDemand(VertexI vertex)
public boolean isSymmetric()
public boolean isEdgeRestricted(EdgeI edge, boolean reverse)
reverse
- set to true if the traversal starts at the 'to' end of the edge and stops at the 'from' end, this can only happen if the edge is undirected.public double getEdgeCost(EdgeI edge, boolean isReverse)
reverse
- is set to true if the traversal starts at the 'to' end of the edge and stops at the 'from' end, this can only happen if the edge is undirected.public double getEdgeTime(EdgeI edge, boolean isReverse)
reverse
- is set to true if the traversal starts at the 'to' end of the edge and stops at the 'from' end, this can only happen if the edge is undirected.public double getEdgeDistance(EdgeI edge, boolean isReverse)
reverse
- is set to true if the traversal starts at the 'to' end of the edge and stops at the 'from' end, this can only happen if the edge is undirected.public boolean isConnectionRestricted(EdgeI inEdge, VertexI vertex, EdgeI outEdge)
inEdge
- the edge traversed to reach the vertex.vertex
- the vertex.outEdge
- the edge traversed to leave the vertex.public double getConnectionCost(EdgeI inEdge, VertexI vertex, EdgeI outEdge)
inEdge
- the edge traversed to reach the vertex.vertex
- the vertex.outEdge
- the edge traversed to leave the vertex.public double getConnectionTime(EdgeI inEdge, VertexI vertex, EdgeI outEdge)
inEdge
- the edge traversed to reach the vertex.vertex
- the vertex.outEdge
- the edge traversed to leave the vertex.
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |