The report is the documentation of project DSPHG (Distributed Shortest Path of Huge Graph).The roject implements the algorithm proposed in "Distributed Shortest Paths for Directed Graphs with Negative Edge Lengths"(Luboš Brim, Ivana Cerná, Pavel Krcál and Radek Pelánek. Faculty of Informatics, Masaryk University, Brno Botanická 68a, Czech Republic). The project applies Java RMI as communication protocol, and distri- butes graph partitions into different remote objects, which interact with each other to calculate the shortest paths in a huge graph.