Summary

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

Details

Page properties

Author

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

Content

...	...	@@ -7,7 +7,7 @@
7	7
8	8	The meta model and generated data structure is contained in the plugin [[{{code language="none"}}de.cau.cs.kieler.core.kgraph{{/code}}>>url:http://rtsys.informatik.uni-kiel.de/fisheye/browse/%7Ebr=master/kieler/plugins/de.cau.cs.kieler.core.kgraph||shape="rect"]].
9	9
10		-See also [[KLayoutData>>doc:KIELER.Home.Discontinued Projects.Infrastructure for Meta Layout (KIML).KLayoutData Meta Model.WebHome]] and [[KRendering>>doc:KIELER.Home.Lightweight Diagrams (KLighD).The KRendering Notation Model.WebHome]].
	10	+See also [[KLayoutData>>doc:Kieler.Discontinued Projects.Infrastructure for Meta Layout (KIML).KLayoutData Meta Model.WebHome]] and [[KRendering>>doc:KIELER.Home.Lightweight Diagrams (KLighD).The KRendering Notation Model.WebHome]].
11	11
12	12
13	13	)))
...	...	@@ -17,7 +17,7 @@
17	17
18	18	[[image:attach:kgraph.png]]
19	19
20		-Each node in a KGraph may contain other nodes, thus representing a nested sub-graph. The graph itself is represented by a top-level node that has no parent node. Nodes may have incoming and outgoing edges, and each edge has references to its source node and its target node. Usage of ports is optional and can be applied to special cases such as data flow diagrams. If ports are used, they each contain a list of connected edges, and the edges have references to their corresponding source port and target port. Nodes, edges, and ports may have arbitrarily many labels, which are usually (but not necessarily) represented by text.Each element of the graph may contain arbitrary additional data, which must implement the interface KGraphData. There are two important extending models that use this interface: [[KLayoutData>>doc:KIELER.Home.Discontinued Projects.Infrastructure for Meta Layout (KIML).KLayoutData Meta Model.WebHome]], which is used to store layout data for the graph, and [[KRendering>>doc:KIELER.Home.Lightweight Diagrams (KLighD).The KRendering Notation Model.WebHome]], which adds graphical information. Graph data inherits from the plain Java IPropertyHolder interface, which enables it to provide a key-value mapping. Keys are IProperty instances, which have an identifier string and a type, and values are arbitrary objects of the corresponding type. This mapping is transient and is thus not stored in the XML format. The makePersistent() operation can be used to translate the mapping into a serializable list of string pairs.
	20	+Each node in a KGraph may contain other nodes, thus representing a nested sub-graph. The graph itself is represented by a top-level node that has no parent node. Nodes may have incoming and outgoing edges, and each edge has references to its source node and its target node. Usage of ports is optional and can be applied to special cases such as data flow diagrams. If ports are used, they each contain a list of connected edges, and the edges have references to their corresponding source port and target port. Nodes, edges, and ports may have arbitrarily many labels, which are usually (but not necessarily) represented by text.Each element of the graph may contain arbitrary additional data, which must implement the interface KGraphData. There are two important extending models that use this interface: [[KLayoutData>>doc:Kieler.Discontinued Projects.Infrastructure for Meta Layout (KIML).KLayoutData Meta Model.WebHome]], which is used to store layout data for the graph, and [[KRendering>>doc:KIELER.Home.Lightweight Diagrams (KLighD).The KRendering Notation Model.WebHome]], which adds graphical information. Graph data inherits from the plain Java IPropertyHolder interface, which enables it to provide a key-value mapping. Keys are IProperty instances, which have an identifier string and a type, and values are arbitrary objects of the corresponding type. This mapping is transient and is thus not stored in the XML format. The makePersistent() operation can be used to translate the mapping into a serializable list of string pairs.
21	21
22	22	== Editing KGraphs ==
23	23