Heuristic algorithm which is based on finding farthest final state from inital state. More...
#include <drawAlgorithm.h>
Inheritance diagram for FarthestFinalDrawAlgorithm:
Collaboration diagram for FarthestFinalDrawAlgorithm:
Public Member Functions | |
| QList< State * > | drawAutomaton (Editor *editor, const QSharedPointer< IAutomaton > &automaton) |
| QString | getName () const |
Detailed Description
Heuristic algorithm which is based on finding farthest final state from inital state.
This path is then used as backbone. Other states and transitions are placed to area according to count of their count.
Definition at line 74 of file drawAlgorithm.h.
Member Function Documentation
| QList< State * > FarthestFinalDrawAlgorithm::drawAutomaton | ( | Editor * | editor, | |
| const QSharedPointer< IAutomaton > & | automaton | |||
| ) | [virtual] |
Returns list of currently created states with transitions assigned, just use ItemsAddCommand on it
- Parameters:
-
startPos is left-top corner of result automaton
Implements IDrawAlgorithm.
Definition at line 474 of file drawAlgorithm.cpp.
References createState(), DBGLOG_DRAW, DBGPAR, State::getName(), and Editor::toScenePos().
Here is the call graph for this function:
| QString FarthestFinalDrawAlgorithm::getName | ( | ) | const [inline, virtual] |
Implements IDrawAlgorithm.
Definition at line 79 of file drawAlgorithm.h.
The documentation for this class was generated from the following files:
- C:/CVUT/diplomka/Automata_editor/sources/drawAlgorithm.h
- C:/CVUT/diplomka/Automata_editor/sources/drawAlgorithm.cpp
