test.py

######################################################
# Tree Variables #####################################
# number of edges		 4
# edge flows			 [0, 0, 0, 0, 10.0, 5.0, -0.0, -0.0]
# node potentials		 [10752.0, -5376.0, -5376.0, -5376.0]
# parent nodes			 [0, 1, 2, 3]
# edges to parents		 [4, 5, 6, 7]
# subtree sizes			 [1, 1, 1, 1]
# next nodes in dfs thread	 [0, 1, 2, 3]
# previous nodes in dfs thread	 [0, 1, 2, 3]
# last descendants in dfs thread [0, 1, 2, 3]
# augmented forest roots	 [0, 1, 2, 3]
# extra edges			 [4, 5, 6, 7]
######################################################
# Data structures ####################################
# nodes			 ['a', 'd', 'b', 'c']
# node indices		 {'a': 0, 'd': 1, 'b': 2, 'c': 3}
# node demands		 [-5, 5, 0, 0]
# edge sources		 [0, 0, 2, 3, 0, 1, 2, 3]
# edge targets		 [2, 3, 1, 1, 0, 1, 2, 3]
# edge indices		 {('a', 'b'): 0, ('a', 'c'): 1, ('b', 'd'): 2, ('c', 'd'): 3}
# edge capacities	 [4, 10, 9, 5, 5376, 5376, 5376, 5376]
# edge weights		 [3, 6, 1, 2, 5376, 5376, 5376, 5376]
# edge multipliers	 [2, 0.5, 4, 1, 0.5, 2, 2, 2]
######################################################
# Pivot Loop #########################################
# entering edges	 0 0 2
# different trees:  True
# cycle_root:  (0, 2)
# Wn1:  None
# We1:  None
# find cycle		 [0] [4] [2] [6]