This project implements classes: graph , adjacency matrix with iterators, Sparse and Dense matrices. Graph's methods include calculating the diameter of graph and the number of bonded components.
-
Updated
Sep 17, 2021 - C++
This project implements classes: graph , adjacency matrix with iterators, Sparse and Dense matrices. Graph's methods include calculating the diameter of graph and the number of bonded components.
This assignment involves creating a temporal graph structure from Twitter data, exploring metrics over five days, identifying important nodes, and detecting communities. Deliverables include a concise report and source files with code.
Add a description, image, and links to the graph-diameter topic page so that developers can more easily learn about it.
To associate your repository with the graph-diameter topic, visit your repo's landing page and select "manage topics."