DGraph is a system for directed graph processing with taking advantage of the strongly connected component structure. On this system, most graph partitions are able to reach convergence in order and need to be loaded into the main memory for exactly once, getting much lower data access cost and faster convergence.