Am I doing this right, because this one seems a little too easy the way I did it:
take into account the path (a,b,d,c,e), which visits each vertex exactly once. Therefore the graph has a Hamilton path.
