(under construction)

This is a C# library intended to gather the most useful and most efficient algorithms in the field.

####Sorting:

• QuickSort
• MergeSort
• HeapSort
• 3Way QuickSort

####DataStructures:

• Min/Max Heap
• UnionFind
• RedBlack Tree
• Tries (coming soon)

####Graphs: ######Structures:

• Undirected Graph
• Directed Graph
• Edge Weighted Grapgh
• Edge Weithed Undirected Graph

######Algorithms:

• Bipartite Detection
• Breadth First Search
• Depth First Search
• Connected Components
• Strongly Connected Components
• Cycle Detection
• Kurskal Minimum Span Tree
• Lazy Prim Minimum Span Tree
• Shortest Path Tree
• Topological Sort