{"push_id":639428887,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"3858d517829bc706db1669ae03de40f3f2678404","before":"2e9505cf0d7ea527b42637f5f2d4a45494e23cff","commits":[{"sha":"3858d517829bc706db1669ae03de40f3f2678404","author":{"email":"f957f56a9914fe70a604235c048886addca4d4c9@TU-Berlin.de","name":"Viktor Engelmann"},"message":"moved the code for vertex-disjoint-paths from the algorithm\nfor directed-tree-decompositions to its own algorithm.\nalso prepared an algorithm for vertex-separators which will\nuse the vertex-disjoint-paths problem (see mengers theorem)\nand referenced that vertex-separator algorithm in the header\nfor directed-tree-decompositions.\n\nfurther, the method RunParallel(...) of the \"Algorithm\" base-class\nnow returns the result again (at least in case there is exactly 1\nalgorithm applicable)","distinct":true,"url":"https://api.github.com/repos/OpenGraphtheory/OpenGraphtheory/commits/3858d517829bc706db1669ae03de40f3f2678404"}]}