changing DistLocalGraph api (#45)

Author: divija95

libcusp/include/galois/graphs/DistributedLocalGraph.h

@@ -586,7 +586,7 @@ class DistLocalGraph {
    */
   inline EdgeTy& getEdgeData(GraphNode src, edge_iterator ni) {
     GraphNode dst = getEdgeDst(ni);
-    auto& r       = graph->getEdgeData(std::make_pair(src, getGID(dst)));
+    auto& r       = graph->getEdgeData(std::make_pair(src, dst));
     return r;
   }
 
@@ -601,9 +601,7 @@ class DistLocalGraph {
    * @param ni edge id to get destination of
    * @returns Local ID of destination of edge ni
    */
-  GraphNode getEdgeDst(edge_iterator ni) {
-    return getGID(graph->getEdgeDst(*ni));
-  }
+  GraphNode getEdgeDst(edge_iterator ni) { return graph->getEdgeDst(*ni); }
 
   /**
    * Gets the first edge of some node.

libwmd/test/wmd-graph-build.cpp

@@ -216,11 +216,11 @@ int main(int argc, char* argv[]) {
         auto end = graph->edge_end(lid);
         auto itr = graph->edge_begin(lid);
         for (; itr != end; itr++) {
-          edgeDst.push_back(graph->getEdgeDst(itr));
+          edgeDst.push_back(graph->getGID(graph->getEdgeDst(itr)));
         }
         std::vector<uint64_t> edgeDstDbg;
         for (auto& e : graph->edges(lid)) {
-          edgeDstDbg.push_back(graph->getEdgeDst(e));
+          edgeDstDbg.push_back(graph->getGID(graph->getEdgeDst(e)));
         }
         assert(edgeDst == edgeDstDbg);
         std::sort(edgeDst.begin(), edgeDst.end());