To represent a non directed and unweighted graph i used not only the upper triangular matrix to avoid redundancies (as edge u-v is the same as edge v-u), but also they are represented by bits, which reduces up to 93% of memory usage.
-
Notifications
You must be signed in to change notification settings - Fork 0
FelipeSchreiber/GraphTheoryBFS-DFS-w-Memory-optimizations
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published