convex: True [True, True, True]
(PC) enum / flow: True True | (LOC): True | I(v): {3: [1, 2, 3], 4: [1, 2], 5: [1, 2, 3], 6: [1, 2, 3], 7: [1, 2, 3], 8: [2], 9: [1, 2, 3]}
number of families of independent arborescences: 6
families on vertices 0..8: 5
by a second enumeration: families on 0..8: 5 | families on 0..9: 6
families on 0..8 that extend to vertex 9: 3 | that do not: 2
certificate: independent (explicit paths): (True, '')
certificate: (P) holds at every vertex: True
v=3: 1 admissible assignments, costs ['0']; minimum unique: True; minimiser = listed tails: True
v=4: 1 admissible assignments, costs ['0']; minimum unique: True; minimiser = listed tails: True
v=5: 1 admissible assignments, costs ['0']; minimum unique: True; minimiser = listed tails: True
v=6: 4 admissible assignments, costs ['-4', '0', '1', '2']; minimum unique: True; minimiser = listed tails: True
v=7: 4 admissible assignments, costs ['-2', '0', '2', '3']; minimum unique: True; minimiser = listed tails: True
v=8: 1 admissible assignments, costs ['0']; minimum unique: True; minimiser = listed tails: True
v=9: 6 admissible assignments, costs ['-3', '-1', '-1', '0', '1', '2']; minimum unique: True; minimiser = listed tails: True
