@Override public Edge<Long, Double> map(Tuple2<Long, Long> tuple2) throws Exception { return new Edge<>(tuple2.f0, tuple2.f1, 0.0); } });
/** * Reverses the direction of this Edge. * @return a new Edge, where the source is the original Edge's target * and the target is the original Edge's source. */ public Edge<K, V> reverse() { return new Edge<>(this.f1, this.f0, this.f2); }
public Edge<K, EV> getEdge() { return new Edge<>(this.f0, this.f1, this.f4); } }
public static final Edge<Long, Double> getDefaultEdgeToBeRemoved() { return new Edge<>(2L, 5L, 2.0); }
private SourceVertexJoinFunction() { this.reuseEdge = new Edge<>(); }
public static DataSet<Edge<Long, Double>> getSimpleEdgeDataSet(ExecutionEnvironment env) { List<Edge<Long, Double>> edges = new ArrayList<>(); edges.add(new Edge<>(1L, 2L, 1.0)); edges.add(new Edge<>(1L, 3L, 2.0)); edges.add(new Edge<>(1L, 4L, 3.0)); edges.add(new Edge<>(1L, 5L, 4.0)); edges.add(new Edge<>(2L, 6L, 5.0)); edges.add(new Edge<>(6L, 7L, 6.0)); edges.add(new Edge<>(6L, 8L, 7.0)); edges.add(new Edge<>(7L, 8L, 8.0)); return env.fromCollection(edges); }
public static final DataSet<Edge<Long, Double>> getDefaultEdgeDataSet(ExecutionEnvironment env) { List<Edge<Long, Double>> edges = new ArrayList<>(); edges.add(new Edge<>(1L, 3L, 3.0)); edges.add(new Edge<>(2L, 4L, 3.0)); edges.add(new Edge<>(2L, 5L, 2.0)); edges.add(new Edge<>(3L, 2L, 1.0)); edges.add(new Edge<>(3L, 5L, 5.0)); edges.add(new Edge<>(4L, 5L, 1.0)); return env.fromCollection(edges); }
public static DataSet<Edge<Long, Double>> getTieEdgeDataSet(ExecutionEnvironment env) { List<Edge<Long, Double>> edges = new ArrayList<>(); edges.add(new Edge<>(1L, 2L, 1.0)); edges.add(new Edge<>(1L, 3L, 1.0)); edges.add(new Edge<>(1L, 4L, 1.0)); edges.add(new Edge<>(1L, 5L, 1.0)); return env.fromCollection(edges); } }
public static final DataSet<Edge<Long, Double>> getDefaultEdgesInSSSP(ExecutionEnvironment env) { List<Edge<Long, Double>> edges = new ArrayList<>(); edges.add(new Edge<>(1L, 3L, 3.0)); edges.add(new Edge<>(2L, 5L, 2.0)); edges.add(new Edge<>(3L, 2L, 1.0)); edges.add(new Edge<>(4L, 5L, 1.0)); return env.fromCollection(edges); }
public static final DataSet<Edge<Long, Double>> getDefaultEdgeDataSet(ExecutionEnvironment env) { List<Edge<Long, Double>> edges = new ArrayList<>(); edges.add(new Edge<>(2L, 1L, 1.0)); edges.add(new Edge<>(5L, 2L, 1.0)); edges.add(new Edge<>(5L, 4L, 1.0)); edges.add(new Edge<>(4L, 3L, 1.0)); edges.add(new Edge<>(4L, 2L, 1.0)); edges.add(new Edge<>(1L, 4L, 1.0)); edges.add(new Edge<>(1L, 2L, 1.0)); edges.add(new Edge<>(1L, 3L, 1.0)); edges.add(new Edge<>(3L, 5L, 1.0)); return env.fromCollection(edges); } }
private static Edge<Long, Double> getEdgeToBeRemoved() { if (fileOutput) { return new Edge<>(srcEdgeToBeRemoved, trgEdgeToBeRemoved, valEdgeToBeRemoved); } else { return IncrementalSSSPData.getDefaultEdgeToBeRemoved(); } } }
public static DataSet<Edge<Long, Double>> getDefaultEdgeDataSet(ExecutionEnvironment env) { List<Edge<Long, Double>> edgeList = new LinkedList<>(); for (Object[] edge : DEFAULT_EDGES) { edgeList.add(new Edge<>((Long) edge[0], (Long) edge[1], (Double) edge[2])); } return env.fromCollection(edgeList); }
private EdgeGroupReducer() { reuseEdge = new Edge<>(); reuseEdgeValue = new EdgeValue<>(); }
public static DataSet<Edge<Long, NullValue>> getDefaultEdgeDataSet(ExecutionEnvironment env) { List<Edge<Long, NullValue>> edges = new ArrayList<>(); edges.add(new Edge<>(1L, 2L, NullValue.getInstance())); edges.add(new Edge<>(1L, 3L, NullValue.getInstance())); edges.add(new Edge<>(2L, 3L, NullValue.getInstance())); edges.add(new Edge<>(2L, 6L, NullValue.getInstance())); edges.add(new Edge<>(3L, 4L, NullValue.getInstance())); edges.add(new Edge<>(3L, 5L, NullValue.getInstance())); edges.add(new Edge<>(3L, 6L, NullValue.getInstance())); edges.add(new Edge<>(4L, 5L, NullValue.getInstance())); edges.add(new Edge<>(6L, 7L, NullValue.getInstance())); return env.fromCollection(edges); }
public static final DataSet<Edge<Long, NullValue>> getDefaultEdgeDataSet(ExecutionEnvironment env) { List<Edge<Long, NullValue>> edges = new ArrayList<>(); edges.add(new Edge<>(1L, 3L, NullValue.getInstance())); edges.add(new Edge<>(2L, 3L, NullValue.getInstance())); edges.add(new Edge<>(4L, 7L, NullValue.getInstance())); edges.add(new Edge<>(5L, 7L, NullValue.getInstance())); edges.add(new Edge<>(6L, 7L, NullValue.getInstance())); edges.add(new Edge<>(7L, 3L, NullValue.getInstance())); return env.fromCollection(edges); }
/** * Creates a set of edges with attached {@link String} values. * * @param env execution environment * @return edge data set with string values */ public static DataSet<Edge<Long, String>> getEdges(ExecutionEnvironment env) { List<Edge<Long, String>> edges = new ArrayList<>(INPUT_EDGES.length); for (String edge : INPUT_EDGES) { String[] tokens = edge.split(";"); edges.add(new Edge<>(Long.parseLong(tokens[0]), Long.parseLong(tokens[1]), tokens[2])); } return env.fromCollection(edges); } }
public static final DataSet<Edge<Long, NullValue>> getTieEdgeDataSet(ExecutionEnvironment env) { List<Edge<Long, NullValue>> edges = new ArrayList<>(); edges.add(new Edge<>(1L, 5L, NullValue.getInstance())); edges.add(new Edge<>(2L, 5L, NullValue.getInstance())); edges.add(new Edge<>(4L, 5L, NullValue.getInstance())); edges.add(new Edge<>(5L, 5L, NullValue.getInstance())); edges.add(new Edge<>(6L, 5L, NullValue.getInstance())); edges.add(new Edge<>(7L, 5L, NullValue.getInstance())); edges.add(new Edge<>(8L, 5L, NullValue.getInstance())); edges.add(new Edge<>(9L, 5L, NullValue.getInstance())); return env.fromCollection(edges); } }
public static DataSet<Edge<Long, NullValue>> getDefaultEdgeDataSet(ExecutionEnvironment env) { List<Edge<Long, NullValue>> edgeList = new LinkedList<>(); for (Object[] edge : DEFAULT_EDGES) { edgeList.add(new Edge<>((long) edge[0], (long) edge[1], NullValue.getInstance())); } return env.fromCollection(edgeList); }
public void reduce(Iterable<Edge<String, Integer>> edges, Collector<Edge<String, NullValue>> out) { List<String> listeners = new ArrayList<>(); for (Edge<String, Integer> edge : edges) { listeners.add(edge.getSource()); } for (int i = 0; i < listeners.size() - 1; i++) { for (int j = i + 1; j < listeners.size(); j++) { out.collect(new Edge<>(listeners.get(i), listeners.get(j), NullValue.getInstance())); } } } }
/** * Adds the given edge to the graph. If the source and target vertices do * not exist in the graph, they will also be added. * * @param source the source vertex of the edge * @param target the target vertex of the edge * @param edgeValue the edge value * @return the new graph containing the existing vertices and edges plus the * newly added edge */ public Graph<K, VV, EV> addEdge(Vertex<K, VV> source, Vertex<K, VV> target, EV edgeValue) { Graph<K, VV, EV> partialGraph = fromCollection(Arrays.asList(source, target), Collections.singletonList(new Edge<>(source.f0, target.f0, edgeValue)), this.context); return this.union(partialGraph); }