Max-flow docs

Co-authored-by: Ioannis Panagiotas <ioannis.panagiotas@neo4j.com>

Author: AlfredClemedtson

doc-test/src/test/java/org/neo4j/gds/doc/MaxFlowDocTest.java

@@ -0,0 +1,52 @@
+/*
+ * Copyright (c) "Neo4j"
+ * Neo4j Sweden AB [http://neo4j.com]
+ *
+ * This file is part of Neo4j.
+ *
+ * Neo4j is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program.  If not, see <http://www.gnu.org/licenses/>.
+ */
+package org.neo4j.gds.doc;
+
+import org.neo4j.gds.functions.AsNodeFunc;
+import org.neo4j.gds.paths.maxflow.MaxFlowMutateProc;
+import org.neo4j.gds.paths.maxflow.MaxFlowStatsProc;
+import org.neo4j.gds.paths.maxflow.MaxFlowStreamProc;
+import org.neo4j.gds.paths.maxflow.MaxFlowWriteProc;
+
+import java.util.List;
+
+class MaxFlowDocTest extends SingleFileDocTestBase {
+
+    @Override
+    protected List<Class<?>> functions() {
+        return List.of(AsNodeFunc.class);
+    }
+    
+    @Override
+    protected List<Class<?>> procedures() {
+        return List.of(
+            MaxFlowStreamProc.class,
+            MaxFlowStatsProc.class,
+            MaxFlowMutateProc.class,
+            MaxFlowWriteProc.class
+        );
+    }
+
+    @Override
+    protected String adocFile() {
+        return "pages/algorithms/max-flow.adoc";
+    }
+
+}

doc-test/src/test/java/org/neo4j/gds/doc/syntax/MaxFlowSyntaxTest.java

@@ -0,0 +1,40 @@
+/*
+ * Copyright (c) "Neo4j"
+ * Neo4j Sweden AB [http://neo4j.com]
+ *
+ * This file is part of Neo4j.
+ *
+ * Neo4j is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program.  If not, see <http://www.gnu.org/licenses/>.
+ */
+package org.neo4j.gds.doc.syntax;
+
+import java.util.List;
+
+class MaxFlowSyntaxTest extends SyntaxTestBase {
+
+    @Override
+    protected Iterable<SyntaxModeMeta> syntaxModes() {
+        return List.of(
+            SyntaxModeMeta.of(SyntaxMode.STREAM),
+            SyntaxModeMeta.of(SyntaxMode.STATS),
+            SyntaxModeMeta.of(SyntaxMode.WRITE),
+            SyntaxModeMeta.of(SyntaxMode.MUTATE)
+        );
+    }
+
+    @Override
+    protected String adocFile() {
+        return "pages/algorithms/max-flow.adoc";
+    }
+}

doc/modules/ROOT/content-nav.adoc

@@ -106,6 +106,7 @@
 *** xref:algorithms/bfs.adoc[]
 *** xref:algorithms/dfs.adoc[]
 *** xref:algorithms/bellman-ford-single-source.adoc[Bellman-Ford Single-Source Shortest Path]
+*** xref:algorithms/max-flow.adoc[]
 *** xref:algorithms/dag/longest-path.adoc[]
 ** xref:algorithms/dag/dag-algorithms.adoc[]
 *** xref:algorithms/dag/topological-sort.adoc[]