/
NetworkFlowQuiz.java
37 lines (34 loc) · 1.2 KB
/
NetworkFlowQuiz.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
/*
* Copyright 2020 Emory University
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package edu.emory.cs.graph.flow;
import edu.emory.cs.graph.Graph;
import edu.emory.cs.graph.Subgraph;
import java.util.HashSet;
import java.util.Set;
/** @author Jinho D. Choi */
public class NetworkFlowQuiz {
/**
* Using depth-first traverse.
* @param graph a directed graph.
* @param source the ource vertex.
* @param target the target vertex.
* @return a set of all augmenting paths between the specific source and target vertices in the graph.
*/
public Set<Subgraph> getAugmentingPaths(Graph graph, int source, int target) {
// TODO: to be updated
return null;
}
}