Big scale graph processing signifies an interesting obstacle mainly because of the deficiency of locality. This paper offers Route Graph for increasing iterative graph computation on graphs with billions of edges. Our procedure structure has a few exceptional features: Very first, we model a substantial graph applying a group of tree-primarily base