|
|
@@ -36,10 +36,12 @@ Figure~\ref{fig:components} contains a component diagram that illustrates these
|
|
|
|
|
|
Advantages of this architecture include:
|
|
|
\begin{itemize}
|
|
|
- \item Modularity, since the class \code{BKNodePlacement} can easily be replaced by other node placement algorithms.
|
|
|
- Minor changes to the internal data structure might be necessary.
|
|
|
- \item It is easily possible to open multiple windows for different graphs.
|
|
|
+ \item It is possible to open multiple windows for different graphs.
|
|
|
This happens already, for example, when loading a graph from a file or when generating a new random graph.
|
|
|
+ \item Modularity, since the class \code{BKNodePlacement} can be replaced by other node placement algorithms.
|
|
|
+ Minor changes to the internal data structure might be necessary.
|
|
|
+ \item Abstraction: When implementing an algorithm there is no need to worry about making \enquote{step over} or \enquote{step out} commands.
|
|
|
+ Also it is not necessary to define how to undo a step (except for some rare cases), although we do not keep a list of states: This would cost too much Memory (10~743 steps for the graph in figure~\ref{fig:originalpapergraph}).
|
|
|
\end{itemize}
|
|
|
|
|
|
\begin{figure}[htp]
|
