Graph exploration algorithm. Each branch is given information of the nodes within a certain distance to it. With this limited information, it will attempt to make the straightest path possible without crossing any other branches.