Here's my attempted datas Python code, so again, we check first to make sure that there really is such a path and if there isn't, then we just quit before we try to find it, but if there is, so somewhere in there, the path exists, what we're going to do is run through all the edges, so node1 in G, look at all the neighbors. 