strong_connectivity_augmentation (374B)
1 # Strong connectivity augmentation 2 3 https://en.wikipedia.org/wiki/Strong_connectivity_augmentation 4 5 minimal number of [edges] to add to make a [directed_graph] [strongly_connected] 6 7 - can be solved in [linear_time] in the unweighted setting 8 - [NP_complete] in the setting of [weighted_graphs] 9 10 cf [raghavan2005note] 11 12 Up: [strongly_connected_component], [graph_modification]