"weighted" graphs

  In this chapter, we learned about "weighted" graphs (graphs with numbers called "weights" on each of its edges), and we learned about two special types of weighted graphs: Minimum Hamilton Circuit: a circuit which visits each vertex in a graph exactly once (returning to the starting vertex) and which has the smallest total weight Minimum Spanning Tree: a subgraph of the original graph which is a tree, which includes all vertices in the original graph, and which has the smallest total weight Research and find an example of how one of these can be applied to solve a real-world problem and report your findings.