Examples

The notebooks below cover the main IduEdu workflows: graph construction, graph inspection, graph editing, object projection, connectivity diagnostics, shortest-path calculations, public-transport registry configuration, and GTFS feeds.

• Build transport graphs
  • Drive graph and the simplify parameter
  • Clipping by the exact territory boundary
  • Keeping the largest component
  • Walk graph
  • Public-transport graph
  • Join public transport with walking
• UrbanGraph basics
  • Nodes and edges
  • Validation and copying
  • Adjacency matrix cache
  • Empty graph
  • Read and write .urbangraph archives
• Graph operations
  • Induced subgraph and relabeling
  • Clip by geometry
  • Multiedge simplification
  • Directed and undirected views
  • Joining compatible graphs
• Connectivity diagnostics
  • Undirected connected components
  • Directed graph connectivity
  • Keep the largest component
• Objects, nearest nodes, and graph projection
  • Create simulated objects near roads
  • Nearest graph nodes
  • Project objects with link edges
  • Project objects without link edges
  • Method form
• Shortest paths and OD matrices
  • One shortest route and its geometry
  • Path matrices: all-to-all and pairwise
  • Single-source distances
  • Multi-source distance to the closest source
  • Nearest source label and distance
  • Independent parallel searches
  • Origin-destination matrix
  • Method equivalents
• Transport registry
  • Inspect a transport specification
  • Create a custom registry
  • Update, ensure, and remove specs
  • Use a registry in graph construction
• GTFS public transport
  • Example feeds
  • Read and validate a feed
  • Build a graph for one service day
  • Merge several feeds
  • Boarding waits by route
  • Stations
  • Plot the graph
  • Join with the walking network
  • Route across the layers