Skip to content

Instantly share code, notes, and snippets.

@ivank2139
Created October 26, 2020 19:59
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save ivank2139/1720ee8eed4ac2d64352629d9c23cb11 to your computer and use it in GitHub Desktop.
Save ivank2139/1720ee8eed4ac2d64352629d9c23cb11 to your computer and use it in GitHub Desktop.
func ProcessEdges(node Node) {
if NodeContains(VisitedNodes, node) {
return
}
EdgeCount += 1
VisitedNodes = append(VisitedNodes, node)
edge := findShortestEdgeFromNode(node)
RouteEdges = append(RouteEdges, edge)
TotalDistance = TotalDistance.Add(edge.Length)
NextNode = Nodes[edge.Node2.Name]
log.Trace.Println("processing next node" + edge.Node2.Name)
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment