|
Stack< Point > | draw (Graphics g, Graph graf, Point start, Point end, int fieldSize) |
|
void | constructPath (int x, int y, int finishX, int finishY, Random r) |
| Lee-Algoritmus (rekurizvne) hlada cestu. More...
|
|
bool | nodeDetected (Graphics g, int x, int y) |
|
Stack< Point > | findPath (int x, int y, int finishX, int finishY) |
|
Stack< Point > | drawIntoPolygon (Graphics g, Graph graf, Point start, Point end, Stack< Point > Polygon) |
|
|
Stack< Point > | path = new Stack<Point>() |
|
void mental_maps.draw.Lee.constructPath |
( |
int |
x, |
|
|
int |
y, |
|
|
int |
finishX, |
|
|
int |
finishY, |
|
|
Random |
r |
|
) |
| |
Lee-Algoritmus (rekurizvne) hlada cestu.
- Parameters
-
g | Graficky komponent |
x | Startovný vrchol - súradnica X |
y | Startovný vrchol - súradnica Y |
finishX | Startovný vrchol - súradnica X |
finishY | Startovný vrchol - súradnica Y |
Stack<Point> mental_maps.draw.Lee.draw |
( |
Graphics |
g, |
|
|
Graph |
graf, |
|
|
Point |
start, |
|
|
Point |
end, |
|
|
int |
fieldSize |
|
) |
| |
Stack<Point> mental_maps.draw.Lee.drawIntoPolygon |
( |
Graphics |
g, |
|
|
Graph |
graf, |
|
|
Point |
start, |
|
|
Point |
end, |
|
|
Stack< Point > |
Polygon |
|
) |
| |
Stack<Point> mental_maps.draw.Lee.findPath |
( |
int |
x, |
|
|
int |
y, |
|
|
int |
finishX, |
|
|
int |
finishY |
|
) |
| |
bool mental_maps.draw.Lee.nodeDetected |
( |
Graphics |
g, |
|
|
int |
x, |
|
|
int |
y |
|
) |
| |
Stack<Point> mental_maps.draw.Lee.path = new Stack<Point>() |
The documentation for this class was generated from the following file: