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