Wheeler Codes

Wheeler Codes, are a small collection of Python codes created for the use of Professor Jeffrey Wheeler and his class.

1. dijkstra, a Python code which implements the Dijkstra algorithm for finding the minimum distance from a given node of a weighted graph to all the other nodes.
2. gradient_descent, a Python code which uses gradient descent to solve a linear least squares (LLS) problem.
3. kruskal, a Python code which implements Kruskal algorithm to compute a minimal spanning tree of a weighted graph.
4. newton, a Python code which approximates the solution of a single nonlinear scalar equation f(x)=0 using Newton's method.
5. prim, a Python code which implements Prim's algorithm to compute a minimal spanning tree of a weighted graph.
6. transportation, a Python code which computes a feasible solution to a simple version of the transportation problem, in which a resource must be transported from several supply centers to several demand centers at minimal cost.
7. tsp, a Python code which seeks the shortest round trip visiting every city on a list, the traveling salesperson problem (TSP).