{"ref":"master","ref_type":"branch","master_branch":"master","description":"An efficient approach of finding the shortest path between two nodes from a graph that makes use of the breadth first search algorithm to achieve linear time complexity - O(m+n).","pusher_type":"user"}
{"actor":{"display_login":"MirunaPislar"}}