Graph Theory Shortest Path Dijkstra Algorithm Implemented Using Set Commands

MATLAB implementations of graph theory algorithms including: Dijkstra's shortest path algorithm using set commands, Floyd-Warshall algorithm for all-pairs shortest paths, Hungarian algorithm (Hungary) for maximum bipartite matching, two methods for minimum spanning tree algorithms, and minimum-cost maximum-flow algorithm.