FindShortestEdgeFromNode.go

func findShortestEdgeFromNode(node Node) Edge {
	minimumEdge := MaxEdge
	for _, edge := range Edges {
		if edge.Node1.Name != node.Name || EdgeContains(UsedEdges, edge) {
			continue
		}
		if edge.Length.LessThan(minimumEdge.Length) && !NodeContains(VisitedNodes, edge.Node2) {
			log.Trace.Println("\nReplaced minimumEdge with shorter edge " + edge.String())
			minimumEdge = edge
		}
	}
	if len(VisitedNodes) == 26 {
		log.Info.Println("\n\tLast node " + node.Name + ", back to origin node " + OriginNode.Name)
		return Edges[node.Name+" - "+OriginNode.Name]
	}
	log.Trace.Println("\n\tShortest edge from " + node.Name + " that has not been used " + minimumEdge.String())
	rcpEdge := Edges[minimumEdge.Node2.Name+" - "+minimumEdge.Node1.Name]
	UsedEdges = append(UsedEdges, minimumEdge)
	UsedEdges = append(UsedEdges, rcpEdge)
	return minimumEdge
}