Sep 15 – Sep 25 In this chapter, we learned about “weighted” graphs (graphs with

Sep 15 – Sep 25
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
Please research and find an example of how one of these can be applied to solve a real-world problem and report your findings.
Directions
Participation in Discussion Boards is a required part of this class (5% of your overall course average).
The requirements for this graded Discussion Board are:
Your initial post is due by the 3rd day of the Discussion Board and must contain at least 100 words.
You must respond to at least two classmates, and your response posts must contain at least 50 words.
Please answer any questions posed in the instructor’s response to your post(s).
All posts should be relevant to the week’s topic(s) and should include substantive, correct math content.
All posts should be grammatically correct – please use Spellcheck as necessary.
Please use APA citation format if you get help from another source (our textbook, another book, a website, etc.). Try to use your own words!