Convert an edge list to an adjacency list, then run BFS with visited sets until the destination is found.