Depends what sort of functionality you need on the graph. Are you
going to be using operations that only perform on the edge set of one
node at a time? In that case, you could probably get by with an
adjacency list representation in Mongo. If you need more complex
operations, like computing shortest paths or performing some sort of
matrix calculations, then you might want to look into the Map/Reduce
capabilities of Mongo.
- Mayank