Minor Change

Changed a comment
This commit is contained in:
SenseiKiwi
2013-12-30 03:29:05 -04:00
parent 70ae2fd407
commit 3e33b94c98

View File

@@ -475,7 +475,7 @@ public class MazeDesigner
// a list of those edges and remove them if they connect two nodes // a list of those edges and remove them if they connect two nodes
// in the same set. Otherwise, merge their sets and keep the edge. // in the same set. Otherwise, merge their sets and keep the edge.
// This is similar to algorithms for spanning trees. The same // This is similar to algorithms for spanning trees. The same
// idea applies for the other doorways with some chance added. // idea applies for the other doorways, plus some randomness.
// First, list all nodes in the subgraph // First, list all nodes in the subgraph
IGraphNode<PartitionNode, DoorwayData> current; IGraphNode<PartitionNode, DoorwayData> current;