consistent big O notation
This commit is contained in:
parent
197fc8591e
commit
956f87fb04
9 changed files with 26 additions and 25 deletions
|
@ -3,7 +3,7 @@
|
|||
//! Also computes as the resulting DAG if each SCC is replaced with a
|
||||
//! node in the graph. This uses [Tarjan's algorithm](
|
||||
//! https://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algorithm)
|
||||
//! that completes in *O(n)* time.
|
||||
//! that completes in *O*(*n*) time.
|
||||
|
||||
use crate::fx::FxHashSet;
|
||||
use crate::graph::vec_graph::VecGraph;
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue