klimesf/b4m33pal-examples

Collection of algorithms taught in B4M33PAL class at FEE CTU.

B4M33PAL - Examples (in C++)

Collection of interesting algorithm implementations (C++) which are taught in B4M33PAL class on FEE CTU.

## Graph traversal

• Breadth-first search
• Depth-first search

Minimum spanning tree

• Borůvka's algorithm
• Kruskal's algorithm
• Prim's algorithm

Strongly connected components

• Kosaraju-Sharir algorithm
• Tarjan's algorithm

Prime numbers

• Sieve of Eratosthenes

## TODO: Euler trail