This is a custom solution to the famous 7 bridges of Konigsberg problem that I started working on for fun after learning about stacks
in data structures course in my university.

The algorithm works for any given graph in the correct format:
The input txt has one line with the names (one character) for each
vertex and then follows one line for each connection between the vertexes. Provide the name of the file inside Main.java and run it.