Hlavna kresliaca trieda. Poskytuje metody pre rychle kreslenie Grafu a predpocitanych ciest / pocitanie novych ciest s vhodnou mentalnou mapou.
More...
|
MaxDifMap | LeeMMMaxDif |
|
LeeMMCM | LeeMMCM = new LeeMMCM() |
|
binary | binaryHeuristic = new binary() |
|
CoridorMap | coridor = new CoridorMap() |
|
Graph | graf = new Graph() |
|
Stack< Point > | path = new Stack<Point>() |
|
int | mentalMapType = 0 |
|
int | algoType = 0 |
|
bool | drawVertexAreas = true |
|
bool | drawCirle = false |
|
bool | drawFillCirle = true |
|
bool | edgePoints = true |
|
bool | drawOriginal = false |
|
bool | drawOld = false |
|
bool | drawDiffPolygon = false |
|
int | vertexArea = 10 |
|
int | vertexSize = 10 |
|
Hlavna kresliaca trieda. Poskytuje metody pre rychle kreslenie Grafu a predpocitanych ciest / pocitanie novych ciest s vhodnou mentalnou mapou.
void Diplo.Graph.MentalMap.MainDraw.draw |
( |
System.Windows.Forms.PaintEventArgs |
e, |
|
|
PictureBox |
pictureBox1, |
|
|
Boolean |
findNewPaths = true |
|
) |
| |
Funkcia pre vykreslenie grafu.
- Parameters
-
e | PaintEventArgs e argument ... |
pictureBox1 | PictureBox, kam budeme malovat. |
void Diplo.Graph.MentalMap.MainDraw.drawGraphInCache |
( |
Graphics |
g | ) |
|
Iba vykreslenie existujuceho grafu
Metóda vykreslí VRCHOLY a HRANY grafu, pricom hrany nepocita - vykresli iba uz ulozeny a vypocitany graf. Metoda je vhodna pre casto a rychlo za sebou sa opakujuce udalosti.
- Parameters
-
Vertex Diplo.Graph.MentalMap.MainDraw.pointDraged |
( |
int |
X, |
|
|
int |
Y |
|
) |
| |
Tahanie vrcholu mysou.
- Parameters
-
- Returns
void Diplo.Graph.MentalMap.MainDraw.resetGrapf |
( |
| ) |
|
Reset grafu do zaciatocneho stavu
The documentation for this class was generated from the following file: