Created
February 7, 2014 16:23
-
-
Save neiled/8866195 to your computer and use it in GitHub Desktop.
min spanning tree
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
private void connectRooms(List<Room> rooms) | |
{ | |
/* | |
Input: A non-empty connected weighted graph with vertices V and edges E (the weights can be negative). | |
Initialize: Vnew = {x}, where x is an arbitrary node (starting point) from V, Enew = {} | |
Repeat until Vnew = V: | |
Choose an edge {u, v} with minimal weight such that u is in Vnew and v is not | |
* (if there are multiple edges with the same weight, any of them may be picked) | |
Add v to Vnew, and {u, v} to Enew | |
Output: Vnew and Enew describe a minimal spanning tree | |
*/ | |
var connectedRooms = new List<Room>(); | |
connectedRooms.Add(rooms.First()); | |
do | |
{ | |
double minDistance = double.MaxValue; | |
Room startRoom = null; | |
Room closestRoom = null; | |
foreach (var connectedRoom in connectedRooms) | |
{ | |
foreach (var roomToTest in rooms) | |
{ | |
if (connectedRooms.Contains(roomToTest) == false) | |
{ | |
if (closestRoom == null) | |
{ | |
closestRoom = roomToTest; | |
minDistance = connectedRoom.DistanceTo(roomToTest); | |
startRoom = connectedRoom; | |
} | |
else if (roomToTest.DistanceTo(connectedRoom) < minDistance) | |
{ | |
closestRoom = roomToTest; | |
minDistance = roomToTest.DistanceTo(connectedRoom); | |
startRoom = connectedRoom; | |
} | |
} | |
} | |
} | |
startRoom.Neighbours.Add(closestRoom); | |
connectedRooms.Add(closestRoom); | |
} while (connectedRooms.Count < rooms.Count); | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment