Package | Description |
---|---|
bwem |
Modifier and Type | Method and Description |
---|---|
ChokePoint |
CPPath.get(int index) |
ChokePoint |
CPPath.get(int index) |
Modifier and Type | Method and Description |
---|---|
List<ChokePoint> |
Area.getChokePoints() |
List<ChokePoint> |
BWMap.getChokePoints() |
List<ChokePoint> |
Graph.getChokePoints() |
List<ChokePoint> |
Graph.getChokePoints() |
List<ChokePoint> |
BWMap.getChokePoints() |
List<ChokePoint> |
Area.getChokePoints() |
List<ChokePoint> |
Area.getChokePoints(Area area) |
List<ChokePoint> |
Area.getChokePoints(Area area) |
Map<Area,List<ChokePoint>> |
Area.getChokePointsByArea() |
Map<Area,List<ChokePoint>> |
Area.getChokePointsByArea() |
Iterator<ChokePoint> |
CPPath.iterator() |
Iterator<ChokePoint> |
CPPath.iterator() |
Modifier and Type | Method and Description |
---|---|
boolean |
ChokePoint.accessibleFrom(ChokePoint chokePoint)
Returns whether this ChokePoint is accessible from cp (through a walkable path).
- Note: the relation is symmetric: this->accessibleFrom(cp) == cp->accessibleFrom(this) - Note: if this == cp, returns true. - Time complexity: O(1) |
boolean |
ChokePoint.accessibleFrom(ChokePoint chokePoint)
Returns whether this ChokePoint is accessible from cp (through a walkable path).
- Note: the relation is symmetric: this->accessibleFrom(cp) == cp->accessibleFrom(this) - Note: if this == cp, returns true. - Time complexity: O(1) |
int |
Graph.distance(ChokePoint cpA,
ChokePoint cpB) |
int |
Graph.distance(ChokePoint cpA,
ChokePoint cpB) |
int |
ChokePoint.distanceFrom(ChokePoint chokePoint)
If accessibleFrom(cp) == false, returns -1.
|
int |
ChokePoint.distanceFrom(ChokePoint chokePoint)
If accessibleFrom(cp) == false, returns -1.
|
CPPath |
Graph.getPath(ChokePoint cpA,
ChokePoint cpB) |
CPPath |
Graph.getPath(ChokePoint cpA,
ChokePoint cpB) |
CPPath |
ChokePoint.getPathTo(ChokePoint cp)
Returns a list of getChokePoints, which is intended to be the shortest walking path from this
ChokePoint to cp.
|
CPPath |
ChokePoint.getPathTo(ChokePoint cp)
Returns a list of getChokePoints, which is intended to be the shortest walking path from this
ChokePoint to cp.
|
Copyright © 2022. All rights reserved.