Implementation of bi-directional-graph in go where I randomized a start point and the code drives me home through the graphs.
Directional Graphs as the name says are graphs that contains directions to N-nodes, each node being another n-directional graph. In this example, I'm using a Bi-directional graph, that means each graph node will have a maximum of two nodes each