{"push_id":543476578,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"7c73f7f846e3c960d130cab523c887d7b1e56107","before":"2602067609cf23a74ff5fdaa69c1c3299bed879f","commits":[{"sha":"7c73f7f846e3c960d130cab523c887d7b1e56107","author":{"email":"33370da33d0ffc8c34b5e5033b303701bc873e26@gmx.net","name":"daniel"},"message":"add the solution for testGraph2 in a PDF file. I took it out of the\nSeminararbeit but with more details. Especially I calculate everything\nthat could be interesting to compare with. Therefor I used the\nalgorithms of the Seminararbeit. Just the thread-Array is different from\nour version (which I used in the solution). So the\nUpdate-Potential-Algorithm out of the Seminararbeit does not work\ncorrectly with it (in my opinion). But in the end it doesn't even matter\nsince we can do it otherwise.","distinct":true,"url":"https://api.github.com/repos/RingoIngo/NetworkSimplex/commits/7c73f7f846e3c960d130cab523c887d7b1e56107"}]}