Summary

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

Details

Page properties

Author

...	...	@@ -1,1 +1,1 @@
1		-XWiki.ssm
	1	+XWiki.als

Content

...	...	@@ -13,7 +13,7 @@
13	13	* It's also the place where we post tutorials. You will spend the first part of the practical working through the tutorials before starting your individual projects.
14	14	* And finally, it's the place where each group will document their project.
15	15
16		-This Wiki is split into two halfs: the [[real-time and embedded systems project>>doc:RTProjectSS15.Real-Time Project SS 15 Home.Real-Time and Embedded Systems Project.WebHome]] and the [[layout project>>doc:RTProjectSS15.Real-Time Project SS 15 Home.Layout Project.WebHome]]. Depending on which of these projects you are part of, you will only contribute to that project's part of the Wiki.
	16	+This Wiki is split into two halfs: the [[real-time and embedded systems project>>doc:RTProjectSS15.Real-Time Project SS 15 Home.Real-Time and Embedded Systems Project.WebHome]] and the [[layout project>>doc:Projects.Real-Time Project SS 15 Home.Layout Project.WebHome]]. Depending on which of these projects you are part of, you will only contribute to that project's part of the Wiki.
17	17
18	18
19	19	{{/layout-cell}}
...	...	@@ -66,7 +66,7 @@
66	66	{{/layout-cell}}
67	67
68	68	{{layout-cell}}
69		-= [[doc:RTProjectSS15.Real-Time Project SS 15 Home.Layout Project.WebHome]] =
	69	+= [[doc:Projects.Real-Time Project SS 15 Home.Layout Project.WebHome]] =
70	70
71	71	Graph layout algorithms are widely used to have computers generate visualizations of graph-like information. To that end, a graph layout algorithm generates a two-dimensional layout that consists of positioning data for nodes (represented as closed shapes) and routing data for edges (represented as curves). There are several approaches for designing graph layout algorithms [1,2].
72	72