Fix MaxFlow constraints

Author: TumoiYorozu

document_en/maxflow.md

@@ -49,6 +49,7 @@ It adds an edge oriented from the vertex `from` to the vertex `to` with the capa
 **@{keyword.constraints}**
 
 - $s \neq t$
+- $0 \leq s, t \lt n$
 - The answer should be in `Cap`.
 
 **@{keyword.complexity}**

document_ja/maxflow.md

@@ -50,6 +50,7 @@ int graph.add_edge(int from, int to, Cap cap);
 **@{keyword.constraints}**
 
 - $s \neq t$
+- $0 \leq s, t \lt n$
 - 帰り値が `Cap` に収まる
 
 **@{keyword.complexity}**