Skip to content
Snippets Groups Projects
Select Git revision
  • master default protected
1 result
You can move around the graph by using the arrow keys.
Created with Raphaël 2.2.028May27232120147630Apr29272624232018179Merge branch 'master' of gitlab.informatik.hu-berlin.de:scherzej/psco-2019-gpmastermasterAdded two smaller graphsIntegrate push relabel Push-Relabel Max FlowA few changes for Edmonds-KarpAdd IBFS invariant verificationAvoid running lb algos without satisfied requirementsFix segfault and assertion failures in IBFS algorithmAdd option for lower bound algo selectionFirst try to include multiple lower bound algorithmsValidate input vectorsTests for Edmonds-KarpAdd IBFS test casesAdd IBFS implementationFixed overflow errorTo do: Tests for edmonds_karpmultiple sources and sinksUpdate benchmarkSome testsNew graph with 40 nodesAdjust member identifiers and datatype of edge indicesAvoid redundant control variableFix assertionDeleted useless linestestint bnb on first graphfixed assertionsremove endless lope cause by next_possible_partition; fixed correctness of algorithm; first decision doesn't create 2 branches anymore (symmetrie)command line argument as file path nowOne test case for max-flow algorithmAdded max-flow cppEdmonds-Karp Max Flowtest exampleFix partition constructorAdd first part of the benchmarkRefactor graph identifiersDelete graph's default constructorRefactor bnbChange pointer to reference to graph in partitionExtend partition to requirements of bnbAvoid confusion with num_vertices() of graph