Java Code Examples for org.apache.flink.graph.Graph#removeEdge()
The following examples show how to use
org.apache.flink.graph.Graph#removeEdge() .
You can vote up the ones you like or vote down the ones you don't like,
and go to the original project or source file by following the links above each example. You may check out the related API usage on the sidebar.
Example 1
Source File: GraphMutationsITCase.java From Flink-CEPplus with Apache License 2.0 | 6 votes |
@Test public void testRemoveInvalidEdge() throws Exception { /* * Test removeEdge() -- invalid edge */ final ExecutionEnvironment env = ExecutionEnvironment.getExecutionEnvironment(); Graph<Long, Long, Long> graph = Graph.fromDataSet(TestGraphUtils.getLongLongVertexData(env), TestGraphUtils.getLongLongEdgeData(env), env); graph = graph.removeEdge(new Edge<>(6L, 1L, 61L)); DataSet<Edge<Long, Long>> data = graph.getEdges(); List<Edge<Long, Long>> result = data.collect(); expectedResult = "1,2,12\n" + "1,3,13\n" + "2,3,23\n" + "3,4,34\n" + "3,5,35\n" + "4,5,45\n" + "5,1,51\n"; compareResultAsTuples(result, expectedResult); }
Example 2
Source File: GraphMutationsITCase.java From flink with Apache License 2.0 | 6 votes |
@Test public void testRemoveInvalidEdge() throws Exception { /* * Test removeEdge() -- invalid edge */ final ExecutionEnvironment env = ExecutionEnvironment.getExecutionEnvironment(); Graph<Long, Long, Long> graph = Graph.fromDataSet(TestGraphUtils.getLongLongVertexData(env), TestGraphUtils.getLongLongEdgeData(env), env); graph = graph.removeEdge(new Edge<>(6L, 1L, 61L)); DataSet<Edge<Long, Long>> data = graph.getEdges(); List<Edge<Long, Long>> result = data.collect(); expectedResult = "1,2,12\n" + "1,3,13\n" + "2,3,23\n" + "3,4,34\n" + "3,5,35\n" + "4,5,45\n" + "5,1,51\n"; compareResultAsTuples(result, expectedResult); }
Example 3
Source File: GraphMutationsITCase.java From flink with Apache License 2.0 | 6 votes |
@Test public void testRemoveInvalidEdge() throws Exception { /* * Test removeEdge() -- invalid edge */ final ExecutionEnvironment env = ExecutionEnvironment.getExecutionEnvironment(); Graph<Long, Long, Long> graph = Graph.fromDataSet(TestGraphUtils.getLongLongVertexData(env), TestGraphUtils.getLongLongEdgeData(env), env); graph = graph.removeEdge(new Edge<>(6L, 1L, 61L)); DataSet<Edge<Long, Long>> data = graph.getEdges(); List<Edge<Long, Long>> result = data.collect(); expectedResult = "1,2,12\n" + "1,3,13\n" + "2,3,23\n" + "3,4,34\n" + "3,5,35\n" + "4,5,45\n" + "5,1,51\n"; compareResultAsTuples(result, expectedResult); }
Example 4
Source File: IncrementalSSSPITCase.java From Flink-CEPplus with Apache License 2.0 | 5 votes |
@Test
public void testIncrementalSSSPNonSPEdge() throws Exception {
ExecutionEnvironment env = ExecutionEnvironment.getExecutionEnvironment();
DataSet<Vertex<Long, Double>> vertices = IncrementalSSSPData.getDefaultVertexDataSet(env);
DataSet<Edge<Long, Double>> edges = IncrementalSSSPData.getDefaultEdgeDataSet(env);
DataSet<Edge<Long, Double>> edgesInSSSP = IncrementalSSSPData.getDefaultEdgesInSSSP(env);
// the edge to be removed is a non-SP edge
Edge<Long, Double> edgeToBeRemoved = new Edge<>(3L, 5L, 5.0);
Graph<Long, Double, Double> graph = Graph.fromDataSet(vertices, edges, env);
// Assumption: all minimum weight paths are kept
Graph<Long, Double, Double> ssspGraph = Graph.fromDataSet(vertices, edgesInSSSP, env);
// remove the edge
graph.removeEdge(edgeToBeRemoved);
// configure the iteration
ScatterGatherConfiguration parameters = new ScatterGatherConfiguration();
if (IncrementalSSSP.isInSSSP(edgeToBeRemoved, edgesInSSSP)) {
parameters.setDirection(EdgeDirection.IN);
parameters.setOptDegrees(true);
// run the scatter gather iteration to propagate info
Graph<Long, Double, Double> result = ssspGraph.runScatterGatherIteration(
new IncrementalSSSP.InvalidateMessenger(edgeToBeRemoved),
new IncrementalSSSP.VertexDistanceUpdater(),
IncrementalSSSPData.NUM_VERTICES, parameters);
DataSet<Vertex<Long, Double>> resultedVertices = result.getVertices();
resultedVertices.writeAsCsv(resultPath, "\n", ",");
env.execute();
} else {
vertices.writeAsCsv(resultPath, "\n", ",");
env.execute();
}
expected = IncrementalSSSPData.VERTICES;
}
Example 5
Source File: GraphMutationsITCase.java From Flink-CEPplus with Apache License 2.0 | 5 votes |
@Test public void testRemoveEdge() throws Exception { /* * Test removeEdge() -- simple case */ final ExecutionEnvironment env = ExecutionEnvironment.getExecutionEnvironment(); Graph<Long, Long, Long> graph = Graph.fromDataSet(TestGraphUtils.getLongLongVertexData(env), TestGraphUtils.getLongLongEdgeData(env), env); // duplicate edge should be preserved in output graph = graph.addEdge(new Vertex<>(1L, 1L), new Vertex<>(2L, 2L), 12L); graph = graph.removeEdge(new Edge<>(5L, 1L, 51L)); DataSet<Edge<Long, Long>> data = graph.getEdges(); List<Edge<Long, Long>> result = data.collect(); expectedResult = "1,2,12\n" + "1,2,12\n" + "1,3,13\n" + "2,3,23\n" + "3,4,34\n" + "3,5,35\n" + "4,5,45\n"; compareResultAsTuples(result, expectedResult); }
Example 6
Source File: IncrementalSSSPITCase.java From flink with Apache License 2.0 | 5 votes |
@Test
public void testIncrementalSSSPNonSPEdge() throws Exception {
ExecutionEnvironment env = ExecutionEnvironment.getExecutionEnvironment();
DataSet<Vertex<Long, Double>> vertices = IncrementalSSSPData.getDefaultVertexDataSet(env);
DataSet<Edge<Long, Double>> edges = IncrementalSSSPData.getDefaultEdgeDataSet(env);
DataSet<Edge<Long, Double>> edgesInSSSP = IncrementalSSSPData.getDefaultEdgesInSSSP(env);
// the edge to be removed is a non-SP edge
Edge<Long, Double> edgeToBeRemoved = new Edge<>(3L, 5L, 5.0);
Graph<Long, Double, Double> graph = Graph.fromDataSet(vertices, edges, env);
// Assumption: all minimum weight paths are kept
Graph<Long, Double, Double> ssspGraph = Graph.fromDataSet(vertices, edgesInSSSP, env);
// remove the edge
graph.removeEdge(edgeToBeRemoved);
// configure the iteration
ScatterGatherConfiguration parameters = new ScatterGatherConfiguration();
if (IncrementalSSSP.isInSSSP(edgeToBeRemoved, edgesInSSSP)) {
parameters.setDirection(EdgeDirection.IN);
parameters.setOptDegrees(true);
// run the scatter gather iteration to propagate info
Graph<Long, Double, Double> result = ssspGraph.runScatterGatherIteration(
new IncrementalSSSP.InvalidateMessenger(edgeToBeRemoved),
new IncrementalSSSP.VertexDistanceUpdater(),
IncrementalSSSPData.NUM_VERTICES, parameters);
DataSet<Vertex<Long, Double>> resultedVertices = result.getVertices();
resultedVertices.writeAsCsv(resultPath, "\n", ",");
env.execute();
} else {
vertices.writeAsCsv(resultPath, "\n", ",");
env.execute();
}
expected = IncrementalSSSPData.VERTICES;
}
Example 7
Source File: GraphMutationsITCase.java From flink with Apache License 2.0 | 5 votes |
@Test public void testRemoveEdge() throws Exception { /* * Test removeEdge() -- simple case */ final ExecutionEnvironment env = ExecutionEnvironment.getExecutionEnvironment(); Graph<Long, Long, Long> graph = Graph.fromDataSet(TestGraphUtils.getLongLongVertexData(env), TestGraphUtils.getLongLongEdgeData(env), env); // duplicate edge should be preserved in output graph = graph.addEdge(new Vertex<>(1L, 1L), new Vertex<>(2L, 2L), 12L); graph = graph.removeEdge(new Edge<>(5L, 1L, 51L)); DataSet<Edge<Long, Long>> data = graph.getEdges(); List<Edge<Long, Long>> result = data.collect(); expectedResult = "1,2,12\n" + "1,2,12\n" + "1,3,13\n" + "2,3,23\n" + "3,4,34\n" + "3,5,35\n" + "4,5,45\n"; compareResultAsTuples(result, expectedResult); }
Example 8
Source File: IncrementalSSSPITCase.java From flink with Apache License 2.0 | 5 votes |
@Test
public void testIncrementalSSSPNonSPEdge() throws Exception {
ExecutionEnvironment env = ExecutionEnvironment.getExecutionEnvironment();
DataSet<Vertex<Long, Double>> vertices = IncrementalSSSPData.getDefaultVertexDataSet(env);
DataSet<Edge<Long, Double>> edges = IncrementalSSSPData.getDefaultEdgeDataSet(env);
DataSet<Edge<Long, Double>> edgesInSSSP = IncrementalSSSPData.getDefaultEdgesInSSSP(env);
// the edge to be removed is a non-SP edge
Edge<Long, Double> edgeToBeRemoved = new Edge<>(3L, 5L, 5.0);
Graph<Long, Double, Double> graph = Graph.fromDataSet(vertices, edges, env);
// Assumption: all minimum weight paths are kept
Graph<Long, Double, Double> ssspGraph = Graph.fromDataSet(vertices, edgesInSSSP, env);
// remove the edge
graph.removeEdge(edgeToBeRemoved);
// configure the iteration
ScatterGatherConfiguration parameters = new ScatterGatherConfiguration();
if (IncrementalSSSP.isInSSSP(edgeToBeRemoved, edgesInSSSP)) {
parameters.setDirection(EdgeDirection.IN);
parameters.setOptDegrees(true);
// run the scatter gather iteration to propagate info
Graph<Long, Double, Double> result = ssspGraph.runScatterGatherIteration(
new IncrementalSSSP.InvalidateMessenger(edgeToBeRemoved),
new IncrementalSSSP.VertexDistanceUpdater(),
IncrementalSSSPData.NUM_VERTICES, parameters);
DataSet<Vertex<Long, Double>> resultedVertices = result.getVertices();
resultedVertices.writeAsCsv(resultPath, "\n", ",");
env.execute();
} else {
vertices.writeAsCsv(resultPath, "\n", ",");
env.execute();
}
expected = IncrementalSSSPData.VERTICES;
}
Example 9
Source File: GraphMutationsITCase.java From flink with Apache License 2.0 | 5 votes |
@Test public void testRemoveEdge() throws Exception { /* * Test removeEdge() -- simple case */ final ExecutionEnvironment env = ExecutionEnvironment.getExecutionEnvironment(); Graph<Long, Long, Long> graph = Graph.fromDataSet(TestGraphUtils.getLongLongVertexData(env), TestGraphUtils.getLongLongEdgeData(env), env); // duplicate edge should be preserved in output graph = graph.addEdge(new Vertex<>(1L, 1L), new Vertex<>(2L, 2L), 12L); graph = graph.removeEdge(new Edge<>(5L, 1L, 51L)); DataSet<Edge<Long, Long>> data = graph.getEdges(); List<Edge<Long, Long>> result = data.collect(); expectedResult = "1,2,12\n" + "1,2,12\n" + "1,3,13\n" + "2,3,23\n" + "3,4,34\n" + "3,5,35\n" + "4,5,45\n"; compareResultAsTuples(result, expectedResult); }
Example 10
Source File: IncrementalSSSP.java From Flink-CEPplus with Apache License 2.0 | 4 votes |
public static void main(String [] args) throws Exception {
if (!parseParameters(args)) {
return;
}
ExecutionEnvironment env = ExecutionEnvironment.getExecutionEnvironment();
Edge<Long, Double> edgeToBeRemoved = getEdgeToBeRemoved();
Graph<Long, Double, Double> graph = IncrementalSSSP.getGraph(env);
// Assumption: all minimum weight paths are kept
Graph<Long, Double, Double> ssspGraph = IncrementalSSSP.getSSSPGraph(env);
// remove the edge
graph.removeEdge(edgeToBeRemoved);
// configure the iteration
ScatterGatherConfiguration parameters = new ScatterGatherConfiguration();
if (isInSSSP(edgeToBeRemoved, ssspGraph.getEdges())) {
parameters.setDirection(EdgeDirection.IN);
parameters.setOptDegrees(true);
// run the scatter-gather iteration to propagate info
Graph<Long, Double, Double> result = ssspGraph.runScatterGatherIteration(new InvalidateMessenger(edgeToBeRemoved),
new VertexDistanceUpdater(), maxIterations, parameters);
DataSet<Vertex<Long, Double>> resultedVertices = result.getVertices();
// Emit results
if (fileOutput) {
resultedVertices.writeAsCsv(outputPath, "\n", ",");
env.execute("Incremental SSSP Example");
} else {
resultedVertices.print();
}
} else {
// print the vertices
if (fileOutput) {
graph.getVertices().writeAsCsv(outputPath, "\n", ",");
env.execute("Incremental SSSP Example");
} else {
graph.getVertices().print();
}
}
}
Example 11
Source File: IncrementalSSSP.java From flink with Apache License 2.0 | 4 votes |
public static void main(String [] args) throws Exception {
if (!parseParameters(args)) {
return;
}
ExecutionEnvironment env = ExecutionEnvironment.getExecutionEnvironment();
Edge<Long, Double> edgeToBeRemoved = getEdgeToBeRemoved();
Graph<Long, Double, Double> graph = IncrementalSSSP.getGraph(env);
// Assumption: all minimum weight paths are kept
Graph<Long, Double, Double> ssspGraph = IncrementalSSSP.getSSSPGraph(env);
// remove the edge
graph.removeEdge(edgeToBeRemoved);
// configure the iteration
ScatterGatherConfiguration parameters = new ScatterGatherConfiguration();
if (isInSSSP(edgeToBeRemoved, ssspGraph.getEdges())) {
parameters.setDirection(EdgeDirection.IN);
parameters.setOptDegrees(true);
// run the scatter-gather iteration to propagate info
Graph<Long, Double, Double> result = ssspGraph.runScatterGatherIteration(new InvalidateMessenger(edgeToBeRemoved),
new VertexDistanceUpdater(), maxIterations, parameters);
DataSet<Vertex<Long, Double>> resultedVertices = result.getVertices();
// Emit results
if (fileOutput) {
resultedVertices.writeAsCsv(outputPath, "\n", ",");
env.execute("Incremental SSSP Example");
} else {
resultedVertices.print();
}
} else {
// print the vertices
if (fileOutput) {
graph.getVertices().writeAsCsv(outputPath, "\n", ",");
env.execute("Incremental SSSP Example");
} else {
graph.getVertices().print();
}
}
}
Example 12
Source File: IncrementalSSSP.java From flink with Apache License 2.0 | 4 votes |
public static void main(String [] args) throws Exception {
if (!parseParameters(args)) {
return;
}
ExecutionEnvironment env = ExecutionEnvironment.getExecutionEnvironment();
Edge<Long, Double> edgeToBeRemoved = getEdgeToBeRemoved();
Graph<Long, Double, Double> graph = IncrementalSSSP.getGraph(env);
// Assumption: all minimum weight paths are kept
Graph<Long, Double, Double> ssspGraph = IncrementalSSSP.getSSSPGraph(env);
// remove the edge
graph.removeEdge(edgeToBeRemoved);
// configure the iteration
ScatterGatherConfiguration parameters = new ScatterGatherConfiguration();
if (isInSSSP(edgeToBeRemoved, ssspGraph.getEdges())) {
parameters.setDirection(EdgeDirection.IN);
parameters.setOptDegrees(true);
// run the scatter-gather iteration to propagate info
Graph<Long, Double, Double> result = ssspGraph.runScatterGatherIteration(new InvalidateMessenger(edgeToBeRemoved),
new VertexDistanceUpdater(), maxIterations, parameters);
DataSet<Vertex<Long, Double>> resultedVertices = result.getVertices();
// Emit results
if (fileOutput) {
resultedVertices.writeAsCsv(outputPath, "\n", ",");
env.execute("Incremental SSSP Example");
} else {
resultedVertices.print();
}
} else {
// print the vertices
if (fileOutput) {
graph.getVertices().writeAsCsv(outputPath, "\n", ",");
env.execute("Incremental SSSP Example");
} else {
graph.getVertices().print();
}
}
}