-
Notifications
You must be signed in to change notification settings - Fork 0
A backtracking solution to the famous problem
License
subamanis/7-Bridges-Of-Konigsberg
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
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.
About
A backtracking solution to the famous problem
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published