compute_solution_cost(path, occupancy_map)
|
|
convert_mst_matrix_to_full_tsp_matrix(...[, ...])
|
|
create_data_model(occupancy_map, time, ...)
|
Stores the data for the problem. |
create_data_model_from_matrix(matrix)
|
Stores the data for the problem. |
create_graph(occupancy_map)
|
|
create_matrix_from_occupancy_map_current_occupancy(...)
|
|
create_matrix_from_occupancy_map_generic(...)
|
|
create_matrix_from_occupancy_map_high_occupancy(...)
|
|
create_matrix_from_occupancy_map_length(...)
|
|
create_matrix_from_occupancy_map_medium_occupancy(...)
|
|
create_matrix_from_vertices_list(...[, ...])
|
|
create_matrix_from_vertices_list_for_mst(...)
|
|
create_matrix_from_vertices_list_from_shortest_path_matrix_tsp(...)
|
|
get_current_occupancies(occupancy_map, ...)
|
|
get_high_occupancy(occupancy_map, idVertex1, ...)
|
|
get_length(occupancy_map, idVertex1, ...)
|
|
get_medium_occupancy(occupancy_map, ...)
|
|
get_solution(manager, routing, solution)
|
Returns the solution as a list of routes. |
hamilton(graph, start_v)
|
|
print_solution(manager, routing, solution)
|
Prints solution on console. |
solve_with_google(occupancy_map, time, ...)
|
Entry point of the program. |
solve_with_google_with_data(data)
|
Entry point of the program. |
solve_with_google_with_data_returning_policy(data)
|
Entry point of the program. |