Lee argoritmus (nedkonceny, nepracuje spravne)
More...
|
Stack< Point > | draw (Graphics g, Graph graf, Point start, Point end, int fieldSize) |
| More...
|
|
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) |
| More...
|
|
|
Stack< Point > | path = new Stack<Point>() |
|
Lee argoritmus (nedkonceny, nepracuje spravne)
void Diplo.Graph.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> Diplo.Graph.Draw.Lee.draw |
( |
Graphics |
g, |
|
|
Graph |
graf, |
|
|
Point |
start, |
|
|
Point |
end, |
|
|
int |
fieldSize |
|
) |
| |
Nájdenie cesty z bodu START do bodu END
- Parameters
-
g | Grafický komponent |
graf | Inštancia grafu |
start | Štart bod |
end | Koncový bod |
fieldSize | Veľkosť plochy pre vrchol |
- Returns
- Cesta, množina bodov
Implements Diplo.Graph.Draw.DrawInterface.
Stack<Point> Diplo.Graph.Draw.Lee.drawIntoPolygon |
( |
Graphics |
g, |
|
|
Graph |
graf, |
|
|
Point |
start, |
|
|
Point |
end, |
|
|
Stack< Point > |
Polygon |
|
) |
| |
Nájdenie cesty z bodu START do bodu END. Pri hľadaní, cesta nemôže výjsť z poligónu (oblasti)
- Parameters
-
g | Grafický komponent |
graf | Inštancia grafu |
start | Štart bod |
end | Koncový bod |
Polygon | Poligon - Koridor |
- Returns
- Cesta, množina bodov
Implements Diplo.Graph.Draw.DrawInterface.
The documentation for this class was generated from the following file: