Summary

• Page properties (1 modified, 0 added, 0 removed)

Details

Page properties

Content

...	...	@@ -6,9 +6,9 @@
6	6
7	7	(% lang="en" class="hps" %)The architecture(% lang="en" %) (% class="hps" %)aims(%%) (% class="hps" %)to separate(%%) (% class="hps" %)most main steps(%%) for layouting a tree a(% lang="en" class="hps" %)nd(% lang="en" %) (% class="hps" %)to solve the layout taks by(%%) (% class="hps" %)the(%%) (% class="hps" %)divide and conquer(%%) (% class="hps" %)principle. The (% class="hps short_text hps" %)individual(% class="hps" %) steps are structured as following.(%%)
8	8
9		-The first thing that is done is the graph import. Since the algorithm works with KIML, it is necessary to import the graph that should be layouted with Mr. Tree. The important data structure (KGraph) is a comparatively complex structure. The tree algorithm does not need all parts of this data structure, so the parts that are necessary are converted into a less complex data structure, the [[MrTGraph data structure>>doc:Kieler.Discontinued Projects.Layout Algorithms (KLay).KLay Mr\. Tree.Data Structure.WebHome]] (TGraph), which is described through a class diagram at its corresponding page. As mentioned before, Mr. Tree runs on that data structure. After execution of the tree algorithm, the TGraph gets reconverted to a KGraph in a graph export phase, so that everything works fine with KIML.
	9	+The first thing that is done is the graph import. Since the algorithm works with KIML, it is necessary to import the graph that should be layouted with Mr. Tree. The important data structure (KGraph) is a comparatively complex structure. The tree algorithm does not need all parts of this data structure, so the parts that are necessary are converted into a less complex data structure, the [[MrTGraph data structure>>doc:KIELER.Discontinued Projects.Layout Algorithms (KLay).KLay Mr\. Tree.Data Structure.WebHome]] (TGraph), which is described through a class diagram at its corresponding page. As mentioned before, Mr. Tree runs on that data structure. After execution of the tree algorithm, the TGraph gets reconverted to a KGraph in a graph export phase, so that everything works fine with KIML.
10	10
11		-The heart of Mr. Tree are the following phases. They are described in more details on [[this page>>doc:Kieler.Discontinued Projects.Layout Algorithms (KLay).KLay Mr\. Tree.The Four Phases.WebHome]].
	11	+The heart of Mr. Tree are the following phases. They are described in more details on [[this page>>doc:KIELER.Discontinued Projects.Layout Algorithms (KLay).KLay Mr\. Tree.The Four Phases.WebHome]].
12	12
13	13	The first phase is named which the comparatively unfamiliar term "treeifying". "Treeifying" is a word that describes a process that builds a tree out of a graph that is no tree. In other words: Mr. Tree should also operate on graphs that are no trees, but that can be converted into trees. Imagine a graph that is nearly a tree. It contains one cycle that destroys the tree property. Now the first phase should detect that cycle, destroy it by removing the edge that destroys the tree property and reinsert that edge again after the tree algorithm was able to operate on that newly build tree.
14	14