Advanced Algorithms

Algorithms implemented by me for the course "Advanced Algorithms" (J. Cnops) at the Ghent University (Master of Science in Industrial Engineering: Information Science)

Build

Use Visual Studio to open the solution and compile all the projects at once. All projects may of may not be working in the correct "algorithmic" way.

Note

It might also be possible to use these with the GNU C++ compiler, although this has not been tested.

Feel free to open up pull requests.

TODO

• Search trees

  • Search
  • Add
  • Delete

• Red-Black trees

  • Search
  • Add
    • Bottom-up
    • Top-down
  • Delete
    • Bottom-up
    • Top-down

• Splay trees

  • Search
  • Add
    • Bottom-up
    • Top-down
  • Delete
    • Bottom-up
    • Top-down

• Randomized searchtrees

• Skip lists

• Optimized binary searchtrees

• Longest Common Sequence

• B-Trees

  • Search
  • Add
  • Delete

• Extendible hashing

• Linear hashing

• Point quadtrees

• PR quadtrees

• K-D trees

• Heaps

---

• Connected graphs

• Strongly connected components

  • in an indirected graph
  • in a directed graph (Kosaraju)

• Biconnected graph

• Eulercircuits

• Bellman-Ford

• Johnson

• Maximum current

• Stable Marriage

• Digital searchtrees

• Tries

  • Binary tries
  • Multiway tries

• Patriciatries

• Ternary searchtrees

• Knuth-Morris-Pratt

• Boyer-Moore

  • Simple
  • Horspool
  • Sunday
  • Good suffix

• Karp-Rabinal

• Shift-And

• Suffixtrees

• Suffixtables