Data Representation

Json, XML, …

Example graph (Graphviz)

graph G {
	node [shape=point];
	init -- load;
	undload -- test;
	load -- run;
	run -- test;
	load -- test;
	test -- init;
}

Create png file

dot -Tpng test.dot -K twopi -o graph1.png

Available Graph processor

• dot
• dot - ``hierarchical or layered drawings of directed graphs. * neato - ``spring model layouts. Neato attempts to minimize a global energy function, which is equivalent to statistical multi-dimensional scaling. The solution is achieved using stress majorization, though the older Kamada-Kawai algorithm, using steepest descent, is also available. fdp implements the Fruchterman-Reingold heuristic including a multigrid solver that handles larger graphs and clustered undirected graphs.
• fdp - ``spring model'' layouts similar to those of neato, but does this by reducing forces rather than working with energy. Fdp implements the Fruchterman-Reingold heuristic including a multigrid solver that handles larger graphs and clustered undirected graphs
• sfdp - multiscale version of fdp for the layout of large graphs.
• twopi - radial layouts, after Graham Wills 97. The nodes are placed on concentric circles depending their distance from a given root node.
• circo - circular layout, after Six and Tollis 99, Kauffman and Wiese 02. This is suitable for certain diagrams of multiple cyclic structures such as certain telecommunications networks.

• Use one of: circo dot fdp neato nop nop1 nop2 osage patchwork sfdp twopi

Neato documentation: http://www.graphviz.org/pdf/neatoguide.pdf