Split graph folder (#4998)

This is a step toward making our export script simpler and enable two way merge in the long run.

Author: gchatelet

cmake/cpp.cmake

@@ -645,6 +645,7 @@ foreach(SUBPROJECT IN ITEMS
  base
  init
  algorithms
+ graph_base
  graph
  constraint_solver
  linear_solver

examples/cpp/BUILD.bazel

@@ -254,7 +254,7 @@ cc_binary(
     srcs = ["jobshop_sat.cc"],
     deps = [
         "//ortools/base",
-        "//ortools/graph:connected_components",
+        "//ortools/graph_base:connected_components",
         "//ortools/sat:cp_model",
         "//ortools/sat:cp_model_cc_proto",
         "//ortools/sat:cp_model_solver",
@@ -418,8 +418,8 @@ cc_binary(
     srcs = ["network_routing_sat.cc"],
     deps = [
         "//ortools/base",
-        "//ortools/graph",
         "//ortools/graph:shortest_paths",
+        "//ortools/graph_base:graph",
         "//ortools/sat:cp_model",
         "//ortools/sat:model",
         "//ortools/util:sorted_interval_list",
@@ -676,8 +676,8 @@ cc_binary(
         "//ortools/algorithms:hungarian",
         "//ortools/base",
         "//ortools/base:timer",
-        "//ortools/graph",
         "//ortools/graph:linear_assignment",
+        "//ortools/graph_base:graph",
         "@abseil-cpp//absl/container:flat_hash_map",
         "@abseil-cpp//absl/flags:flag",
         "@abseil-cpp//absl/strings:string_view",
@@ -749,8 +749,8 @@ cc_binary(
     srcs = ["linear_assignment_api.cc"],
     deps = [
         "//ortools/base",
-        "//ortools/graph",
         "//ortools/graph:linear_assignment",
+        "//ortools/graph_base:graph",
     ],
 )
 
@@ -767,9 +767,9 @@ cc_binary(
     srcs = ["flow_api.cc"],
     deps = [
         "//ortools/base",
-        "//ortools/graph",
         "//ortools/graph:generic_max_flow",
         "//ortools/graph:min_cost_flow",
+        "//ortools/graph_base:graph",
     ],
 )
 
@@ -785,8 +785,8 @@ cc_binary(
     srcs = ["max_flow.cc"],
     deps = [
         "//ortools/base",
-        "//ortools/graph",
         "//ortools/graph:generic_max_flow",
+        "//ortools/graph_base:graph",
         "@abseil-cpp//absl/base:log_severity",
         "@abseil-cpp//absl/log",
         "@abseil-cpp//absl/log:globals",

examples/cpp/dimacs_assignment.cc

@@ -27,8 +27,8 @@
 #include "ortools/base/init_google.h"
 #include "ortools/base/logging.h"
 #include "ortools/base/timer.h"
-#include "ortools/graph/graph.h"
 #include "ortools/graph/linear_assignment.h"
+#include "ortools/graph_base/graph.h"
 
 ABSL_FLAG(bool, assignment_compare_hungarian, false,
           "Compare result and speed against Hungarian method.");

examples/cpp/flow_api.cc

@@ -16,8 +16,8 @@
 #include "ortools/base/init_google.h"
 #include "ortools/base/logging.h"
 #include "ortools/graph/generic_max_flow.h"
-#include "ortools/graph/graph.h"
 #include "ortools/graph/min_cost_flow.h"
+#include "ortools/graph_base/graph.h"
 
 namespace operations_research {
 

examples/cpp/jobshop_sat.cc

@@ -30,7 +30,7 @@
 #include "google/protobuf/text_format.h"
 #include "google/protobuf/wrappers.pb.h"
 #include "ortools/base/init_google.h"
-#include "ortools/graph/connected_components.h"
+#include "ortools/graph_base/connected_components.h"
 #include "ortools/sat/cp_model.h"
 #include "ortools/sat/cp_model.pb.h"
 #include "ortools/sat/cp_model_solver.h"

examples/cpp/linear_assignment_api.cc

@@ -17,8 +17,8 @@
 
 #include "ortools/base/init_google.h"
 #include "ortools/base/logging.h"
-#include "ortools/graph/graph.h"
 #include "ortools/graph/linear_assignment.h"
+#include "ortools/graph_base/graph.h"
 
 namespace operations_research {
 

examples/cpp/max_flow.cc

@@ -20,7 +20,7 @@
 #include "absl/log/log.h"
 #include "ortools/base/init_google.h"
 #include "ortools/graph/generic_max_flow.h"
-#include "ortools/graph/graph.h"
+#include "ortools/graph_base/graph.h"
 
 namespace operations_research {
 

examples/cpp/network_routing_sat.cc

@@ -46,8 +46,8 @@
 #include "absl/strings/str_format.h"
 #include "absl/strings/string_view.h"
 #include "ortools/base/init_google.h"
-#include "ortools/graph/graph.h"
 #include "ortools/graph/shortest_paths.h"
+#include "ortools/graph_base/graph.h"
 #include "ortools/sat/cp_model.h"
 #include "ortools/sat/model.h"
 #include "ortools/util/sorted_interval_list.h"

ortools/algorithms/BUILD.bazel

@@ -325,9 +325,9 @@ cc_library(
         ":dynamic_permutation",
         ":sparse_permutation",
         "//ortools/base:murmur",
-        "//ortools/graph",
-        "//ortools/graph:iterators",
-        "//ortools/graph:util",
+        "//ortools/graph_base:graph",
+        "//ortools/graph_base:iterators",
+        "//ortools/graph_base:util",
         "//ortools/util:stats",
         "//ortools/util:time_limit",
         "@abseil-cpp//absl/algorithm:container",
@@ -359,9 +359,9 @@ cc_test(
         "//ortools/base:gmock_main",
         "//ortools/base:map_util",
         "//ortools/base:path",
-        "//ortools/graph:io",
-        "//ortools/graph:random_graph",
-        "//ortools/graph:util",
+        "//ortools/graph_base:io",
+        "//ortools/graph_base:random_graph",
+        "//ortools/graph_base:util",
         "@abseil-cpp//absl/numeric:bits",
         "@abseil-cpp//absl/random",
         "@abseil-cpp//absl/random:distributions",

ortools/algorithms/find_graph_symmetries.cc

@@ -40,9 +40,9 @@
 #include "ortools/algorithms/dynamic_partition.h"
 #include "ortools/algorithms/dynamic_permutation.h"
 #include "ortools/algorithms/sparse_permutation.h"
-#include "ortools/graph/graph.h"
-#include "ortools/graph/iterators.h"
-#include "ortools/graph/util.h"
+#include "ortools/graph_base/graph.h"
+#include "ortools/graph_base/iterators.h"
+#include "ortools/graph_base/util.h"
 
 ABSL_FLAG(bool, minimize_permutation_support_size, false,
           "Tweak the algorithm to try and minimize the support size"