New answers tagged graphs
Prove there is an algorithm that needs at most n-1 comparisons to check if n-element array has all equal elements?
Recursively deleting spanning forest from graph, how many iterations maximum to get to the empty graph?
Confuse on proof of theorem 22.9 (White-path theorem) Depth-First search (DFS) on Cormen-Leiserson-Rivest-Stein "Introduction to algorithms" book
Top 50 recent answers are included