This algorithm, takes the current node, finds all the neighbors, puts them in a queue, dequeues one by one and traverses till the end or it finds the path. This algorithm, takes the current node, finds all the neighbors, puts them in a stack, pops by one and traverses till the end or it finds the path. There are three algorithms which are easy to implement and understand. There are so many algorithms which can find paths between two points.
