ortools/graph - google/or-tools

Google's Operations Research tools:

0 0 0 C++

	csharp
	java
	python
	samples
	testdata
	assignment_test.cc	4.3 KB
	assignment.cc	3.3 KB
	assignment.h	5.4 KB
	bidirectional_dijkstra_test.cc	8.6 KB
	bidirectional_dijkstra.h	18.8 KB
	bounded_dijkstra_test.cc	32.6 KB
	bounded_dijkstra.h	30.6 KB
	BUILD.bazel	21.1 KB
	christofides_test.cc	13.7 KB
	christofides.h	15.1 KB
	cliques_test.cc	28.3 KB
	cliques.cc	14.5 KB
	cliques.h	27.5 KB
	CMakeLists.txt	2.5 KB
	dag_connectivity_test.cc	5.4 KB
	dag_connectivity.cc	4.7 KB
	dag_connectivity.h	2.5 KB
	dag_constrained_shortest_path_test.cc	35.7 KB
	dag_constrained_shortest_path.cc	3.3 KB
	dag_constrained_shortest_path.h	38.2 KB
	dag_shortest_path_test.cc	49.7 KB
	dag_shortest_path.cc	4.8 KB
	dag_shortest_path.h	27.7 KB
	eulerian_path_test.cc	8.3 KB
	eulerian_path.h	6.5 KB
	flow_problem.proto	3.1 KB
	generic_max_flow_test.cc	31.9 KB
	generic_max_flow.h	58.5 KB
	hamiltonian_path_test.cc	21.2 KB
	hamiltonian_path.h	38.5 KB
	k_shortest_paths_test.cc	17.7 KB
	k_shortest_paths.h	23.6 KB
	linear_assignment_test.cc	25.5 KB
	linear_assignment.cc	1.1 KB
	linear_assignment.h	60.9 KB
	max_flow_test.cc	6.6 KB
	max_flow.cc	4.8 KB
	max_flow.h	5.4 KB
	min_cost_flow_test.cc	43.9 KB
	min_cost_flow.cc	47.2 KB
	min_cost_flow.h	30.6 KB
	minimum_spanning_tree_test.cc	11.4 KB
	minimum_spanning_tree.h	7.0 KB
	minimum_vertex_cover_test.cc	3.3 KB
	minimum_vertex_cover.cc	3.6 KB
	minimum_vertex_cover.h	1.4 KB
	multi_dijkstra_test.cc	11.0 KB
	multi_dijkstra.h	8.3 KB
	one_tree_lower_bound_test.cc	3.0 KB
	one_tree_lower_bound.h	20.2 KB
	perfect_matching_test.cc	12.3 KB
	perfect_matching.cc	44.8 KB
	perfect_matching.h	19.5 KB
	README.md	10.0 KB
	rooted_tree_test.cc	23.1 KB
	rooted_tree.h	29.5 KB
	shortest_paths_test.cc	19.5 KB
	shortest_paths.h	31.8 KB
	solve_flow_model.cc	14.2 KB