iduedu.multi_source_dijkstra_path

iduedu.multi_source_dijkstra_path(urban_graph, *, gdf_origins=None, gdf_destinations=None, origins_nodes=None, destination_nodes=None, graph_node_column='graph_node_id', weight='time_min', mode='all_to_all', threshold=None, max_workers=None)

Return shortest node paths between origin and destination inputs.

Inputs follow od_matrix(): pass node ids or object tables whose geometries are matched to graph nodes. all_to_all returns a sparse path matrix, while pairwise matches origins and destinations by position and returns one sparse path column.

Return type:

DataFrame

Parameters:

• urban_graph (UrbanGraph)

• gdf_origins (DataFrame | None)

• gdf_destinations (DataFrame | None)

• origins_nodes (Iterable[Any] | None)

• destination_nodes (Iterable[Any] | None)

• graph_node_column (str)

• weight (Literal['length_meter', 'time_min'])

• mode (Literal['all_to_all', 'pairwise'])

• threshold (float | None)

• max_workers (int | None)