| ... |
... |
@@ -14,7 +14,7 @@ |
| 14 |
14 |
|
| 15 |
15 |
{{toc maxLevel="2"/}} |
| 16 |
16 |
|
| 17 |
|
-[[doc:KIELER.Downloads - KIELER Layout Algorithms]] |
|
17 |
+[[doc:Downloads - KIELER Layout Algorithms]] |
| 18 |
18 |
|
| 19 |
19 |
{{excerpt-include/}} |
| 20 |
20 |
|
| ... |
... |
@@ -26,16 +26,6 @@ |
| 26 |
26 |
|
| 27 |
27 |
= Architecture = |
| 28 |
28 |
|
| 29 |
|
-The architecture basically consists of two chunks: the graph model and the actual implementation of the algorithm. |
| 30 |
|
- |
| 31 |
|
-== Graph Model == |
| 32 |
|
- |
| 33 |
|
-KLay Force uses a custom, lightweight graph model whose root is the {{code language="none"}}FGraph{{/code}} class. {{code language="none"}}FNode{{/code}} instances are connected through {{code language="none"}}FEdge{{/code}} instances that, to be routed properly, can have {{code language="none"}}FBendpoint{{/code}} instances. Edges and nodes can have a number of {{code language="none"}}FLabel{{/code}} instances. Nodes, labels, and bend points are considered {{code language="none"}}FParticle{{/code}}s since they exert forces on each other. The following is a class diagram of the basic graph model: |
| 34 |
|
- |
| 35 |
|
-[[image:attach:KLayForce_Model.png]] |
| 36 |
|
- |
| 37 |
|
-== Algorithm == |
| 38 |
|
- |
| 39 |
39 |
{{warning title="ToDo"}} |
| 40 |
40 |
Describe architecture. |
| 41 |
41 |
{{/warning}} |