Contents Menu Expand Light mode Dark mode Auto light/dark, in light mode Auto light/dark, in dark mode Skip to content
IduEdu 2.0.0 documentation
Logo
IduEdu 2.0.0 documentation
  • High-level functions
    • iduedu.get_drive_graph
    • iduedu.get_walk_graph
    • iduedu.get_public_transport_graph
    • iduedu.get_intermodal_graph
    • iduedu.join_pt_walk_graph
  • Graph data model
  • Migrating to UrbanGraph
  • Benchmarks and design notes
  • Transport registry
    • iduedu.TransportSpec
    • iduedu.TransportRegistry
  • Graph utilities
    • iduedu.connected_components
    • iduedu.weakly_connected_components
    • iduedu.strongly_connected_components
    • iduedu.number_connected_components
    • iduedu.number_weakly_connected_components
    • iduedu.number_strongly_connected_components
    • iduedu.largest_connected_component
    • iduedu.largest_weakly_connected_component
    • iduedu.largest_strongly_connected_component
    • iduedu.largest_component
    • iduedu.relabel_urban_graph
    • iduedu.subgraph_by_nodes
    • iduedu.clip_urban_graph
    • iduedu.join_urban_graphs
    • iduedu.nearest_nodes
    • iduedu.project_objects2urban_graph
    • iduedu.apply_urban_graph_changes
    • iduedu.read_urban_graph
    • iduedu.write_urban_graph
    • iduedu.validate_graph
  • Optional NetworkX utilities
    • iduedu.graph2gdf
    • iduedu.gdf2graph
    • iduedu.keep_largest_nx_component
    • iduedu.clip_nx_graph
    • iduedu.read_gml
    • iduedu.write_gml
    • iduedu.reproject_graph
  • Matrices
    • iduedu.single_source_dijkstra_path_length
    • iduedu.multi_source_dijkstra_path_length
    • iduedu.multi_source_dijkstra_nearest_source
    • iduedu.dijkstra_path_length_parallel
    • iduedu.od_matrix
  • Overpass helpers
    • iduedu.get_4326_boundary
  • Examples
    • Build transport graphs
    • UrbanGraph basics
    • Graph operations
    • Connectivity diagnostics
    • Objects, nearest nodes, and graph projection
    • Shortest paths and OD matrices
    • Transport registry
Back to top

iduedu.largest_strongly_connected_component¶

iduedu.largest_strongly_connected_component(graph)[source]¶

Return the largest strongly connected component.

See also

https://iduclub.github.io/IduEdu/examples/connectivity.html

Return type:

set[Any]

Parameters:

graph (UrbanGraph)

Next
iduedu.largest_component
Previous
iduedu.largest_weakly_connected_component
Copyright © 2026, Donny
Made with Sphinx and @pradyunsg's Furo
On this page
  • iduedu.largest_strongly_connected_component
    • largest_strongly_connected_component()