def main(): G = avg.randomEulerianGraph(10) C = cactus.Cactus(G) NC = normalized.NormalizedCactus(C) BC = balancedCactus.BalancedCactus(NC) OC = oriented.OrientedCactus(BC) H = cycleCover.initialHistory(OC) assert areUnitFlows(X.cycle for X in H.parent)
def main(): G = avg.randomEulerianGraph(10) C = cactus.Cactus(G) N = normalizedCactus.NormalizedCactus(C) orientedCactus = oriented.OrientedCactus(N) print orientedCactus print '>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>' res = sample(cycleCover.initialHistory(orientedCactus), 20)[-1] print res res.validate()
def main(): G = avg.randomEulerianGraph(100) C = cactus.Cactus(G) print C print '>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>' N = NormalizedCactus(C) print N for c in N.chains: print c assert N.isFullyNormalized()
def main(): G = avg.randomEulerianGraph(10) C = cactus.Cactus(G) print C print '>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>' for chain in C.chains: print chain OC = OrientedCactus(C) print OC print OC.netStats() print OC.stats()
def main(): G = avg.randomEulerianGraph(10) print G print '>>>>>>>>>>>>>>>>>>>>>>>>>>>' cactus = Cactus(G) assert all(X in cactus.blockChain for X in cactus.nodeBlock.values()) print cactus assert all(X in cactus.blockChain for X in cactus.nodeBlock.values()) cactus.validate() for chain in cactus.chains: print chain
def main(): G = avg.randomEulerianGraph(10) C = cactus.Cactus(G) N = normalized.NormalizedCactus(C) O = orientedCactus.OrientedCactus(N) print '>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>' print O print '>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>' CH = cycleCover.initialHistory(O) print CH print '>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>' N = random.choice(O.nets) NH = createNewHistory(CH, CH.netHistories[N]) NH.validate()