diff --git a/decisionTree/graph.go b/decisionTree/graph.go
index 57a16f5..41f8870 100644
--- a/decisionTree/graph.go
+++ b/decisionTree/graph.go
@@ -12,13 +12,11 @@ var edges []Edge
 
 func GraphFromDBRows(vs []Vertex, es []Edge) GraphPart {
 	// As our graph is a simple tree (as opposed to polytree etc), there is always a single root node. It's not strictly
-	//necessary to find that node up front, but it does help make this example simpler.
+	// necessary to find that node up front, but it does help make this example simpler.
 	rootQuestion := getRootVertex(vs, es)
 
-	/**
-	Since building the graph is a recursive operation, we can keep the stack a bit lighter (and our function signatures
-	simpler) by storing the questions and edges in package variables.
-	*/
+	// Since building the graph is a recursive operation, we can keep the stack a bit lighter (and our function signatures
+	// simpler) by storing the questions and edges in package variables.
 	edges = es
 
 	// Storing questions as a map for easy lookup by ID later