Target graph size:
Minimum number of vertices:
Minimum number of edges:
Term:
h(g(c,x2),f(x2),f(x0))
Graph:
; h(g(c,x2),f(x2),f(x0)) ; 5 3 -> 0 5 -> 6 5 -> 7 5 -> 3 6 -> 4 6 -> 2 7 -> 2
0 7 0 0 0 1 0 0 3 6 7 3 2 4 2 1 2
Vertex list:
[5,7,6,4,3,2,1,0]