Private experiment
Twittor Graph Engine
A directed weighted follow graph exploring degrees of separation and mutual-connection suggestions.
Java · Graph algorithms
- Directed weighted graph
- Floyd-Warshall
01 / Problem
The constraint
Represent asymmetric connections and answer relationship queries across a small graph.
02 / Structure
Architecture at a glance
- Follow relationships
- Directed weighted graph
- All-pairs paths + suggestions
03 / Implementation
Engineering decisions
- Model follow relationships as directed weighted edges.
- Use Floyd-Warshall for all-pairs shortest paths and degrees-of-separation queries.
- Persist graph state using versioned Java serialization.
04 / Evidence
Measurement context
Author-supplied notes describe a 500+ user graph and versioned Java serialization. Public source and the dataset are unavailable.
05 / Trade-offs
Limits worth stating
- O(V³) all-pairs computation is unsuitable for a production-scale social network.
- Serialization compatibility needs explicit version handling.