Daniel@0: /*
Daniel@0:  * The transitive 6-net, also known as Heawood's graph,
Daniel@0:  * can be used to test the "stability points" of the layout
Daniel@0:  * algorithm.
Daniel@0: 
Daniel@0:  * The "ideal" layout occurs when len="2.5". The layout
Daniel@0:  * loses the regularity when smaller values are used.
Daniel@0:  */
Daniel@0: graph "Heawood" {
Daniel@0: 	node [
Daniel@0: 		fontname = "Arial"
Daniel@0: 		label = "\N"
Daniel@0: 		shape = "circle"
Daniel@0: 		width = "0.50000"
Daniel@0: 		height = "0.500000"
Daniel@0: 		color = "black"
Daniel@0: 	]
Daniel@0: 	edge [
Daniel@0: 		color = "black"
Daniel@0: 	]
Daniel@0: 	/* The outer wheel */
Daniel@0: 	"0" -- "1" -- "2" -- "3" -- "4" -- "5" -- "6" -- "7" -- "8" -- "9" -- "10" -- "11" -- "12" -- "13" -- "0";
Daniel@0: 	/* The internal edges. The len = makes them internal */
Daniel@0: 	"0" -- "5" [len = 2.5];
Daniel@0: 	"2" -- "7" [len = 2.5];
Daniel@0: 	"4" -- "9" [len = 2.5];
Daniel@0: 	"6" -- "11" [len = 2.5];
Daniel@0: 	"8" -- "13" [len = 2.5];
Daniel@0: 	"10" -- "1" [len = 2.5];
Daniel@0: 	"12" -- "3" [len = 2.5];
Daniel@0: }