added List<Long> getEdgesBetween(v1v2); into grapg ADT
added getSourceTarget which returns a set of the vertices connected to a given edge
wuhuu\! made a fancy way for checking consecutive vertices in undirected path
added another ngeative test for isEulerianPath. is now works good. now copying into algorithm
little formatting
moved isEulerianPath into static HierholerAlgorithm
added getEdgeInKWithPositiveDegree
making CycleBeginningAtUsingEdges....
70% finished. still two functions to make