Disable the node names by default; they take a tiny bit of time.

1 files changed, 10 insertions, 4 deletions

diff --git a/planning/planning.cpp b/planning/planning.cpp
index 0878909..590d6b1 100644
--- a/planning/planning.cpp
+++ b/planning/planning.cpp
@@ -418,19 +418,25 @@ void Planner::construct_graph(const vector<Switch> &switches, Graph *g)
 	}
 	
 	g->all_nodes.push_back(&g->source_node);
-	strcpy(g->source_node.name, "source");
-
 	g->all_nodes.push_back(&g->sink_node);
-	strcpy(g->sink_node.name, "sink");
 
 	for (unsigned i = 0; i < NUM_DISTRO; ++i) {
 		g->all_nodes.push_back(&g->distro_nodes[i]);
-		sprintf(g->distro_nodes[i].name, "distro%d", i);
 	}
 	for (unsigned i = 0; i < switches.size(); ++i) {
 		g->all_nodes.push_back(&g->switch_nodes[i]);
+	}
+
+#if 0
+	strcpy(g->source_node.name, "source");
+	strcpy(g->sink_node.name, "sink");
+	for (unsigned i = 0; i < NUM_DISTRO; ++i) {
+		sprintf(g->distro_nodes[i].name, "distro%d", i);
+	}
+	for (unsigned i = 0; i < switches.size(); ++i) {
 		sprintf(g->switch_nodes[i].name, "switch%d", i);
 	}
+#endif
 }
 
 void Planner::find_mincost_maxflow(Graph *g)