Java mini-project: modelling a social network using an undirected graph, completed in pairs. Key focus on selecting appropriate data structures for graph traversal and relationship queries.
Academic pair project developed over several lab sessions for the OOP course at ESEO. The central design challenge was selecting appropriate data structures: simple collections could store users but could not efficiently represent relationships. An undirected graph with an adjacency matrix was chosen to support vertex traversal, neighbour queries, and edge additions/removals.
The architecture relies on three classes: User (profile data), GraphSocialNetwork (matrix operations and graph queries), and RezoSocial (business logic). An interactive console menu enables user registration, friend additions, mutual friend lookups, and adjacency matrix display.
This project highlighted real-world design trade-offs (fixed arrays vs ArrayLists, static shared state) and the importance of unit testing rigour.