Calculate the shortest path between two nodes on a graph

Calculate the shortest path between two nodes on a graph

get_shortest_path(graphs, start_node, end_node)

Arguments

graphs	list containing the two graphs and a map linking the two to each other.
start_node	Starting node for shortest path route.
end_node	Ending node for shortest path route.

Value

list containing the data.frame of the graph elements the shortest path lies on and the path distance.

Examples

not_run({
    graph <- road_data_sample
    start_pt <- c (11.603,48.163)
    end_pt <- c (11.608,48.167)
    pts <- select_vertices_by_coordinates (graph, start_pt, end_pt)
    route_start <- pts[1]
    route_end <- pts [2]
    get_shortest_path (graphs = graph, start_node = route_start,
    end_node = route_end)
})