Skip to content

Reasonably Efficient Data Structure Implementations

License

Notifications You must be signed in to change notification settings

Hammad-Izhar/redi

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

redi: Reasonably Efficient Data Structure Implementations

Planned Data Structures / Algorithm Implementations

Graphs

Data Structure Implementations

  • Undirected Graph
  • Directed Graph
  • Directed Acyclic Graph
  • Planar Graph

Algorithm Implementations

  • Ford-Fulkerson
  • Blossom Algorithm
  • Approximate Distance Oracles
  • Shortest Path (Dijkstra)
  • DFS/BFS
  • MST
  • Steiner Tree Approximation?
  • TSP Approximations?
  • Planar Verification
  • Eulerian Tour Computation

Priority Queues

  • Binary Heaps
  • Fibonacci Heaps
  • van Emde Boas tree

Trees

  • Splay Tree
  • AVL Tree
  • Treap
  • Link Cut Tree
  • Red Black Tree
  • B/B+ Tree
  • Scapegoat Tree

Lock-Free Data Structures?

  • Concurrent Hashtables?
  • Skiplists?
  • Linked Lists
  • Concurrent Priority Queues

About

Reasonably Efficient Data Structure Implementations

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages