src/practice/0-0-candidate-algorithms.md
# Candidate Algorithms
## Graph
* A*
* Floyd-Warshal
* Flood fill
* Graph coloring
* Graph connectivity
* Kruskal's minimal spanning tree
## Tree
* Tree rotation
* Red-Black tree
## Sorting
* Quicksort
* Merge sort
* Heap sort
## Other
* Priority queue