Topological sort, union-find, trie, bit tricks

Also written: topological sort, union-find, trie, tries, bit tricks, Dijkstra

Four less common algorithm techniques: ordering tasks that depend on each other, tracking groups that merge, a tree of letters for prefix search, and bit-level manipulation tricks.