assignment - efficient way to connect a big network
Post on 20-Jul-2015
56 Views
Preview:
TRANSCRIPT
Project assignment
Determing the most efficient way
to connect the network
Tom von Hegedus, Jochem Lentz, George Karlos,
Zakaria Nafid, Mike Spadaru,
Group 4c
Understand the problem
We have 2 problems:
• Total weight of the initial graph
• Total weight of the Minmumspanningtree
• initial weight – minimumspannigtree
weight = the solution
What do we have?
• A text document with a lot of numbers
• We know that the weighted graph has 40
vertices.
• So we need a 40x40 matrix
WeightedAdjacency Matrix
• WeightedAdjacencyMatrix[m] // MatrixForm
• VertexList[m];
TableForm
[Normal@WeightedAdjacencyMatrix[m],
TableHeadings®{c=Style[#,Blue]&/@%,c}]
Solution strategies/ Algorithms/
tools
• Divide the problem into sub problems
• Prim’s Algorithm
• We used the site of Mathematica a lot
top related