Graph algorithms

Lessons in this group, roughly in build order:

• a-algorithm — A* is a best-first shortest-path search that orders the frontier by f(n) = g(n) + h(n) — known cost so far…
• minimum-spanning-tree — A minimum spanning tree (MST) is a subset of edges of a connected, undirected, weighted graph that…
• kruskal-s-algorithm — A greedy algorithm that builds a minimum spanning tree by sorting all edges and adding the cheapest one…