checkpoint 2025-08-22

README.md

@@ -7,36 +7,36 @@
 - Create a custom to_graph method which displays a maxflow graph
 
 TODOs
-- [ ] Implementation of Algos:
+- [x] Implementation of Algos:
     - [x] Ford-Fulkersson (DFS zur Berechnung des flusserhöhenden/augmentierenden Pfads)
     - [x] Edmonds-Karp (BFS zur Berechnung des flusserhöhenden/augmnetierenden Pfads)
     - [x] Dinic
-    - [ ] Goldberg-Tarjan/Preflow-Push
-- [ ] Step-by-step implementation for all algos
+    - [x] Goldberg-Tarjan/Preflow-Push
+- [x] Step-by-step implementation for all algos
     - [x] Ford-Fulkerson
     - [x] Edmonds-Karp
     - [x] Dinic
-    - [ ] Goldberg-Tarjan/Preflow-Push
+    - [x] Goldberg-Tarjan/Preflow-Push
 - [x] Mark edges which have active flows with a color
 - [x] Move GUI Graph conversion to a trait of StableGraph
-- [ ] Add graph positioning strategy which looks "nicer"#
+- [ ] Add graph positioning strategy which looks "nicer"
     - [x] Only insert nodes which are at least a distance of 40 away (default)
     - [ ] Pseudo-random node positioning strategy
-- [ ] Handle residual edges properly
+- [x] Handle residual edges properly
     - [x] Add display option for residual edges
 - [x] Only show active flows (filter all edges with f=0)
-- [ ] Show normal vs residual graph
+- [x] Show normal vs residual graph -> not needed, residual graph is shown by default
 - [x] When increasing flows, handle residual path
-- [ ] Add unit tests
-    - [ ] With small problems to prove correctness
-    - [ ] For Benchmarking the algos
-    - [ ] Check validity of the generated flows (incoming flows = outgoing flows; flow <= capacity)
-- [ ] Add info display pane
+- [x] Add unit tests
+    - [x] With small problems to prove correctness
+    - [x] For Benchmarking the algos
+    - [x] Check validity of the generated flows (incoming flows = outgoing flows; flow <= capacity)
+- [x] Add info display pane
     - [x] is valid flow? (add trait to graph)
     - [x] current total flow (add trait to calculate)
-    - [ ] number of steps
-- [ ] implement PartialEq for StableGraph (not really possible -> how do you compare graphs?)
-- [ ] Step-by-step vizualisation with choosable time delay
+    - [x] number of steps (is implemented for stepwise)
+- [x] implement PartialEq for StableGraph (not really possible -> how do you compare graphs?) -> implemented a prune_zero trait & compare node/edge weights for same index
+- [x] Step-by-step vizualisation with choosable time delay
 - [ ] Dinic: add GUI options to show Layer Graph and Blocking flow
 - [ ] Goldberg-Tarjan: show distance labels at nodes
 - [x] change GUI colors to accomodate color-blindness (blue-yellow rather than red-green)