-
Notifications
You must be signed in to change notification settings - Fork 0
The project is done under the Algorithms course, demonstrating three different algorithms for finding very short circular trajectories in the Neighborhood Matrix graph or the Neighbors list graph. With maximum emphasis on efficiency
AvivBk/Shortest-cycles-in-Graph
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
About
The project is done under the Algorithms course, demonstrating three different algorithms for finding very short circular trajectories in the Neighborhood Matrix graph or the Neighbors list graph. With maximum emphasis on efficiency
Topics
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published