Package com.intel.hadoop.graphbuilder.preprocess.mapreduce.keyvalue

Examples of com.intel.hadoop.graphbuilder.preprocess.mapreduce.keyvalue.VertexEdgeUnionType.vertex()

94
95
96
97
98
99
100
101
102
103
104
    while (iter.hasNext()) {
      next = iter.next();
      // Apply reduce on vertex
      if (next.flag() == VertexEdgeUnionType.VERTEXVAL) {
        Object vid = next.vertex().vid();
        if (vertexset.containsKey(vid)) { // duplicate vertex
          if (VertexFunc != null)
            vertexset.put(vid,
                VertexFunc.reduce(next.vertex().vdata(), vertexset.get(vid)));
        } else {
View Full Code Here
98
99
100
101
102
103
104
105
106
107
108
      if (next.flag() == VertexEdgeUnionType.VERTEXVAL) {
        Object vid = next.vertex().vid();
        if (vertexset.containsKey(vid)) { // duplicate vertex
          if (VertexFunc != null)
            vertexset.put(vid,
                VertexFunc.reduce(next.vertex().vdata(), vertexset.get(vid)));
        } else {
          if (VertexFunc != null)
            vertexset.put(vid,
                VertexFunc.reduce(next.vertex().vdata(), VertexFunc.base()));
          else
View Full Code Here
102
103
104
105
106
107
108
109
110
111
112
            vertexset.put(vid,
                VertexFunc.reduce(next.vertex().vdata(), vertexset.get(vid)));
        } else {
          if (VertexFunc != null)
            vertexset.put(vid,
                VertexFunc.reduce(next.vertex().vdata(), VertexFunc.base()));
          else
            vertexset.put(vid, next.vertex().vdata());
        }
      } else {
        // Apply reduce on edges, remove self and (or merge) duplicate edges.
View Full Code Here
104
105
106
107
108
109
110
111
112
113
114
        } else {
          if (VertexFunc != null)
            vertexset.put(vid,
                VertexFunc.reduce(next.vertex().vdata(), VertexFunc.base()));
          else
            vertexset.put(vid, next.vertex().vdata());
        }
      } else {
        // Apply reduce on edges, remove self and (or merge) duplicate edges.
        // Optionally remove bidirectional edge.
        Pair p = new Pair(next.edge().source(), next.edge().target());
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.