Package cgl.imr.types

Examples of cgl.imr.types.BytesValue

37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
        System.err.println("Reduce Input Error!");
        throw new TwisterException("Reduce input error no values.");
      }

      for (Value value : values) {
        BytesValue val = (BytesValue) value;
        Node node = new Node(val.getBytes());
       
        ID = node.getID();

        // save only the minimum distance for each edge
        for (int v : node.getEdges().keySet()) {
          if (node.getEdgeWeight(v) < edgeWeights.get(v))
            edgeWeights.put(v, node.getEdgeWeight(v));
        }
      }

      // create the new node with non-redundant edges and edge with minimum
      // distance and emit it
      Node n = new Node(ID);
      for (int i = 1; i <= 1000; i++) {
        if (edgeWeights.get(i) != Integer.MAX_VALUE)
          n.setEdgeWeight(i, edgeWeights.get(i));
      }

      collector.collect(new StringKey("" + n.getID()), new BytesValue(n
          .getBytes()));
    } catch (SerializationException e) {
      e.printStackTrace();
      throw new TwisterException(e);
    }
View Full Code Here
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
                  + thisNode.getEdgeWeight(v1);
              adjacentNode.setEdgeWeight(v1, sumOfEdgeWeights);
            }
          }
          collector.collect(new StringKey("" + adjacentNode.getID()),
              new BytesValue(adjacentNode.getBytes()));
          setNodeToNullForGarbageCollection(adjacentNode);
        }
        collector.collect(new StringKey("" + thisNode.getID()),
            new BytesValue(thisNode.getBytes()));
      }
    } catch (SerializationException e) {
      throw new TwisterException(e);
    }
  }
View Full Code Here
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
      for (int y : x.getNodes().keySet())
        System.out.print(y + "| ");
      count++;
    }
    StringKey key = null;
    BytesValue value = null;

    int keyNo = 0;
    for (Graph g : subgraphs) {
      key = new StringKey("" + keyNo);
      try {
        value = new BytesValue(g.getBytes());
      } catch (SerializationException e) {
        e.printStackTrace();
      }
      keyValues.add(new KeyValuePair(key, value));
      keyNo++;
View Full Code Here
TOP

Related Classes of cgl.imr.types.BytesValue

  • Dijkstra.AllPairsShortestPathMap
  • Dijkstra.AllPairsShortestPathReduce
  • Dijkstra.GraphSearch
    • Copyright © 2018 www.massapicom. 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.