graph: fix build

This commit is contained in:
Corentin Le Molgat
2024-01-19 18:31:16 +01:00
parent 8b78a63b53
commit 2d9b003e12
14 changed files with 4184 additions and 17 deletions

View File

@@ -11,24 +11,34 @@
# See the License for the specific language governing permissions and
# limitations under the License.
load(":code_samples.bzl", "code_sample_cc_py", "code_sample_java")
code_sample_cc_py(name = "assignment_linear_sum_assignment")
code_sample_cc_py(name = "assignment_min_flow")
code_sample_cc_py(name = "balance_min_flow")
code_sample_cc_py(name = "simple_max_flow_program")
code_sample_cc_py(name = "simple_min_cost_flow_program")
load(":code_samples.bzl", "code_sample_cc", "code_sample_cc_py", "code_sample_java")
code_sample_java(name = "AssignmentLinearSumAssignment")
code_sample_cc_py(name = "assignment_linear_sum_assignment")
code_sample_java(name = "AssignmentMinFlow")
code_sample_cc_py(name = "assignment_min_flow")
code_sample_java(name = "BalanceMinFlow")
code_sample_cc_py(name = "balance_min_flow")
code_sample_cc(name = "bfs_directed")
code_sample_cc(name = "bfs_one_to_all")
code_sample_cc(name = "bfs_undirected")
code_sample_cc(name = "dag_shortest_path_one_to_all")
code_sample_cc(name = "dag_shortest_path_sequential")
code_sample_cc(name = "dag_simple_shortest_path")
code_sample_cc(name = "dijkstra_all_pairs_shortest_paths")
code_sample_cc(name = "dijkstra_directed")
code_sample_cc(name = "dijkstra_one_to_all")
code_sample_cc(name = "dijkstra_sequential")
code_sample_cc(name = "dijkstra_undirected")
code_sample_java(name = "SimpleMaxFlowProgram")
code_sample_cc_py(name = "simple_max_flow_program")
code_sample_java(name = "SimpleMinCostFlowProgram")
code_sample_cc_py(name = "simple_min_cost_flow_program")

View File

@@ -21,11 +21,17 @@ def code_sample_cc(name):
srcs = [name + ".cc"],
deps = [
"//ortools/base",
"//ortools/base:status_macros",
"//ortools/base:top_n",
"//ortools/graph:assignment",
"//ortools/graph:bounded_dijkstra",
"//ortools/graph:bfs",
"//ortools/graph:dag_shortest_path",
"//ortools/graph:ebert_graph",
"//ortools/graph:linear_assignment",
"//ortools/graph:max_flow",
"//ortools/graph:min_cost_flow",
"@com_google_absl//absl/random",
],
)
@@ -36,11 +42,17 @@ def code_sample_cc(name):
deps = [
":" + name + "_cc",
"//ortools/base",
"//ortools/base:status_macros",
"//ortools/base:top_n",
"//ortools/graph:assignment",
"//ortools/graph:bounded_dijkstra",
"//ortools/graph:bfs",
"//ortools/graph:dag_shortest_path",
"//ortools/graph:ebert_graph",
"//ortools/graph:linear_assignment",
"//ortools/graph:max_flow",
"//ortools/graph:min_cost_flow",
"@com_google_absl//absl/random",
],
)