The goal of this project is to implement a graph-related algorithm. This algorithm was introduced in 2004 and detects social structures in a graph. By performing experiments on the implementation of this algorithm, you must calculate the amount of memory consumed and runtime for graphs of different sizes. Also, you need to calculate the impact of different sorting algorithms on time and memory consumption.
-
Notifications
You must be signed in to change notification settings - Fork 0
The goal of this project is to implement a graph-related algorithm. This algorithm was introduced in 2004 and detects social structures in a graph. By performing experiments on the implementation of this algorithm, you must calculate the amount of memory consumed and runtime for graphs of different sizes. Also, you need to calculate the impact o…
mahdghce/Identify-social-structures-in-graphs
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
The goal of this project is to implement a graph-related algorithm. This algorithm was introduced in 2004 and detects social structures in a graph. By performing experiments on the implementation of this algorithm, you must calculate the amount of memory consumed and runtime for graphs of different sizes. Also, you need to calculate the impact o…
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published