aequilibrae.transit.map_matching_graph#

Classes

MMGraph(lib_gtfs)

Build specialized map-matching graphs.
class aequilibrae.transit.map_matching_graph.MMGraph(lib_gtfs)[source]#

Build specialized map-matching graphs. Not designed to be used by the final user

build_graph_with_broken_stops(mode_id: int, distance_to_project=200)[source]#

Build the graph for links for a certain mode while splitting the closest links at stops’ projection

Arguments:

mode_id (int): Mode ID for which we will build the graph for

distance_to_project (float, Optional): Radius search for links to break at the stops. Defaults to 50m

connect_node(stop) → None[source]#