ben/random-stuff
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Some whitespace changes

Browse Source
This commit is contained in:
Ben Vezzani
2024-09-20 11:17:40 -04:00
parent e699bde720
commit a69792e3fc
1 changed files with 3 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
decisionTree/graph.go
View File

@@ -12,13 +12,11 @@ var edges []Edge
func GraphFromDBRows(vs []Vertex, es []Edge) GraphPart { 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 // 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) rootQuestion := getRootVertex(vs, es)
/** // Since building the graph is a recursive operation, we can keep the stack a bit lighter (and our function signatures
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.
simpler) by storing the questions and edges in package variables.
*/
edges = es edges = es
// Storing questions as a map for easy lookup by ID later // Storing questions as a map for easy lookup by ID later