Algorithms and data structures implemented in Swift
- Dijkstra - finding the shortest paths between nodes in a graph.
- Depth-first search - traversing the graph, exploring as far as possible along each branch before backtracking.
- Breadth-first search - traversing the graph, exploring all nodes at the present depth prior to moving on to the nodes at the next depth level.
- Kruskal - finding a minimum spanning forest of an undirected edge-weighted graph.