graph-diameter

Miura-ori origami flip graphs: candidate general diameter proof using convex order, majorization, and discrete Lipschitz functions, with reproducible verification.

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.