Added anchor to reference chapter 10.

Driolar · web-flow · commit cc84be0f199b · 2026-03-12T15:20:45.000+01:00
diff --git a/Chapters/Chapter10/chapter10.md b/Chapters/Chapter10/chapter10.md
@@ -1,5 +1,7 @@
 ## Maximum Flow
 
+@cha:maxflow
+
 The Maximum Flow problem is about finding the maximum flow through a directed graph, from one node in the graph to another.
 
 The problem can be used to model a wide variety of real-world situations, such as transportation systems, communication networks, and resource allocation.
