Skip to Content

Changes for page KLay Force

Last modified by Richard Kreissig on 2023/09/14 10:17
From version 6.1
edited by Richard Kreissig
on 2023/09/14 10:17
Change comment: There is no comment for this version
To version 3.1
edited by cds
on 2014/09/29 16:13
Change comment: There is no comment for this version

Summary

Details

Page properties
Parent
... ... @@ -1,1 +1,0 @@
1 -KIELER.Discontinued Projects.Layout Algorithms (KLay).WebHome
Author
... ... @@ -1,1 +1,1 @@
1 -XWiki.stu230980
1 +XWiki.cds
Content
... ... @@ -1,10 +1,9 @@
1 -Project Overview
2 -
1 +{{panel title="Project Overview" borderStyle="dashed"}}
3 3  Responsible:
4 4  
5 5  * Christoph Daniel Schulze
5 +{{/panel}}
6 6  
7 -
8 8  KLay Force is an implementation of the force-based layout approach where edges are regarded as springs pulling together the nodes they connect, while unconnected nodes are pushed apart from one another. The objective is to compute a state where this physical system reaches an equilibrium.
9 9  
10 10  This page describes the available layout options as well as the general architecture of the algorithm.
... ... @@ -15,10 +15,10 @@
15 15  
16 16  {{toc maxLevel="2"/}}
17 17  
18 -[[doc:KIELER.Downloads - KIELER Layout Algorithms]]
17 +[[doc:Downloads - KIELER Layout Algorithms]]
19 19  
19 +{{excerpt-include/}}
20 20  
21 -
22 22  = Layout Options =
23 23  
24 24  {{warning title="ToDo"}}
... ... @@ -27,18 +27,10 @@
27 27  
28 28  = Architecture =
29 29  
30 -The architecture basically consists of two chunks: the graph model and the actual implementation of the algorithm.
31 -
32 -== Graph Model ==
33 -
34 -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:
35 -
36 -[[image:attach:KLayForce_Model.png]]
37 -
38 -== Algorithm ==
39 -
40 40  {{warning title="ToDo"}}
41 41  Describe architecture.
42 42  {{/warning}}
43 43  
33 +
44 44  
35 +
KLayForce_Model.png
Author
... ... @@ -1,1 +1,0 @@
1 -XWiki.XWikiGuest
Size
... ... @@ -1,1 +1,0 @@
1 -136.4 KB
Content
Confluence.Code.ConfluencePageClass[0]
Id
... ... @@ -1,1 +1,1 @@
1 -9471847
1 +9471852
URL
... ... @@ -1,1 +1,1 @@
1 -https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/KIELER/pages/9471847/KLay Force
1 +https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/KIELER/pages/9471852/KLay Force