Problems Base course RU

Built on

stack

Articles

GRA Algorithm Depth-first search Goes deep, marks each vertex's entry and exit and finds cycles by them in O(V + E). O(V + E) 2 problems GRA Algorithm Bridges and articulation points Streets and crossroads without which a graph falls apart: one depth-first search with the numbers tin and low, O(V + E). O(V + E) 2 problems GRA Algorithm Eulerian path Go along every edge exactly once: the odd-vertex rule and Hierholzer's algorithm in O(E). O(V + E) 3 problems GEO Algorithm Convex hull The smallest convex polygon containing all the points, in O(n log n). O(n log n) 2 problems TEC Technique Amortized analysis A bound on a whole sequence of operations, not on each one: by a sum, by coins and by a potential, and where it does not help. a bound on a sequence 2 problems

Problems

An import cycle A ring from its pieces The order modules run in Two swapped keys

Often together

classic 5 traversal 3 graph 3 interviews 3 contests 3 connectivity 2 maps and navigation 2 dependency order 1 recursion 1 builds and packages 1 compilers 1 networks 1