Java Code Examples for org.apache.flink.graph.Graph#removeEdges()

The following examples show how to use org.apache.flink.graph.Graph#removeEdges() . 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

5 votes

vote down

vote up

@Test
public void testRemoveEdges() throws Exception {
	/*
	 * Test removeEdges() -- simple case
	 */

	final ExecutionEnvironment env = ExecutionEnvironment.getExecutionEnvironment();

	Graph<Long, Long, Long> graph = Graph.fromDataSet(TestGraphUtils.getLongLongVertexData(env),
			TestGraphUtils.getLongLongEdgeData(env), env);
	List<Edge<Long, Long>> edgesToBeRemoved = new ArrayList<>();
	edgesToBeRemoved.add(new Edge<>(5L, 1L, 51L));
	edgesToBeRemoved.add(new Edge<>(2L, 3L, 23L));

	// duplicate edge should be preserved in output
	graph = graph.addEdge(new Vertex<>(1L, 1L), new Vertex<>(2L, 2L), 12L);

	graph = graph.removeEdges(edgesToBeRemoved);

	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" +
			"3,4,34\n" +
			"3,5,35\n" +
			"4,5,45\n";

	compareResultAsTuples(result, expectedResult);
}

Example 2

Source File: GraphMutationsITCase.java From Flink-CEPplus with Apache License 2.0

5 votes

vote down

vote up

@Test
public void testRemoveSameEdgeTwice() throws Exception {
	/*
	 * Test removeEdges() -- try to remove the same edge twice
	 */

	final ExecutionEnvironment env = ExecutionEnvironment.getExecutionEnvironment();

	Graph<Long, Long, Long> graph = Graph.fromDataSet(TestGraphUtils.getLongLongVertexData(env),
			TestGraphUtils.getLongLongEdgeData(env), env);
	List<Edge<Long, Long>> edgesToBeRemoved = new ArrayList<>();
	edgesToBeRemoved.add(new Edge<>(5L, 1L, 51L));
	edgesToBeRemoved.add(new Edge<>(5L, 1L, 51L));

	graph = graph.removeEdges(edgesToBeRemoved);

	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";

	compareResultAsTuples(result, expectedResult);
}

Example 3

Source File: GraphMutationsITCase.java From Flink-CEPplus with Apache License 2.0

5 votes

vote down

vote up

@Test
public void testRemoveOneValidOneInvalidEdge() throws Exception {
	/*
	 * Test removeEdges() -- one edge is valid, the other is invalid
	 */

	final ExecutionEnvironment env = ExecutionEnvironment.getExecutionEnvironment();

	Graph<Long, Long, Long> graph = Graph.fromDataSet(TestGraphUtils.getLongLongVertexData(env),
			TestGraphUtils.getLongLongEdgeData(env), env);
	List<Edge<Long, Long>> edgesToBeRemoved = new ArrayList<>();
	edgesToBeRemoved.add(new Edge<>(1L, 1L, 51L));
	edgesToBeRemoved.add(new Edge<>(6L, 1L, 61L));

	graph = graph.removeEdges(edgesToBeRemoved);

	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: GraphMutationsITCase.java From flink with Apache License 2.0

5 votes

vote down

vote up

@Test
public void testRemoveEdges() throws Exception {
	/*
	 * Test removeEdges() -- simple case
	 */

	final ExecutionEnvironment env = ExecutionEnvironment.getExecutionEnvironment();

	Graph<Long, Long, Long> graph = Graph.fromDataSet(TestGraphUtils.getLongLongVertexData(env),
			TestGraphUtils.getLongLongEdgeData(env), env);
	List<Edge<Long, Long>> edgesToBeRemoved = new ArrayList<>();
	edgesToBeRemoved.add(new Edge<>(5L, 1L, 51L));
	edgesToBeRemoved.add(new Edge<>(2L, 3L, 23L));

	// duplicate edge should be preserved in output
	graph = graph.addEdge(new Vertex<>(1L, 1L), new Vertex<>(2L, 2L), 12L);

	graph = graph.removeEdges(edgesToBeRemoved);

	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" +
			"3,4,34\n" +
			"3,5,35\n" +
			"4,5,45\n";

	compareResultAsTuples(result, expectedResult);
}

Example 5

Source File: GraphMutationsITCase.java From flink with Apache License 2.0

5 votes

vote down

vote up

@Test
public void testRemoveSameEdgeTwice() throws Exception {
	/*
	 * Test removeEdges() -- try to remove the same edge twice
	 */

	final ExecutionEnvironment env = ExecutionEnvironment.getExecutionEnvironment();

	Graph<Long, Long, Long> graph = Graph.fromDataSet(TestGraphUtils.getLongLongVertexData(env),
			TestGraphUtils.getLongLongEdgeData(env), env);
	List<Edge<Long, Long>> edgesToBeRemoved = new ArrayList<>();
	edgesToBeRemoved.add(new Edge<>(5L, 1L, 51L));
	edgesToBeRemoved.add(new Edge<>(5L, 1L, 51L));

	graph = graph.removeEdges(edgesToBeRemoved);

	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";

	compareResultAsTuples(result, expectedResult);
}

Example 6

Source File: GraphMutationsITCase.java From flink with Apache License 2.0

5 votes

vote down

vote up

@Test
public void testRemoveOneValidOneInvalidEdge() throws Exception {
	/*
	 * Test removeEdges() -- one edge is valid, the other is invalid
	 */

	final ExecutionEnvironment env = ExecutionEnvironment.getExecutionEnvironment();

	Graph<Long, Long, Long> graph = Graph.fromDataSet(TestGraphUtils.getLongLongVertexData(env),
			TestGraphUtils.getLongLongEdgeData(env), env);
	List<Edge<Long, Long>> edgesToBeRemoved = new ArrayList<>();
	edgesToBeRemoved.add(new Edge<>(1L, 1L, 51L));
	edgesToBeRemoved.add(new Edge<>(6L, 1L, 61L));

	graph = graph.removeEdges(edgesToBeRemoved);

	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 7

Source File: GraphMutationsITCase.java From flink with Apache License 2.0

5 votes

vote down

vote up

@Test
public void testRemoveEdges() throws Exception {
	/*
	 * Test removeEdges() -- simple case
	 */

	final ExecutionEnvironment env = ExecutionEnvironment.getExecutionEnvironment();

	Graph<Long, Long, Long> graph = Graph.fromDataSet(TestGraphUtils.getLongLongVertexData(env),
			TestGraphUtils.getLongLongEdgeData(env), env);
	List<Edge<Long, Long>> edgesToBeRemoved = new ArrayList<>();
	edgesToBeRemoved.add(new Edge<>(5L, 1L, 51L));
	edgesToBeRemoved.add(new Edge<>(2L, 3L, 23L));

	// duplicate edge should be preserved in output
	graph = graph.addEdge(new Vertex<>(1L, 1L), new Vertex<>(2L, 2L), 12L);

	graph = graph.removeEdges(edgesToBeRemoved);

	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" +
			"3,4,34\n" +
			"3,5,35\n" +
			"4,5,45\n";

	compareResultAsTuples(result, expectedResult);
}

Example 8

Source File: GraphMutationsITCase.java From flink with Apache License 2.0

5 votes

vote down

vote up

@Test
public void testRemoveSameEdgeTwice() throws Exception {
	/*
	 * Test removeEdges() -- try to remove the same edge twice
	 */

	final ExecutionEnvironment env = ExecutionEnvironment.getExecutionEnvironment();

	Graph<Long, Long, Long> graph = Graph.fromDataSet(TestGraphUtils.getLongLongVertexData(env),
			TestGraphUtils.getLongLongEdgeData(env), env);
	List<Edge<Long, Long>> edgesToBeRemoved = new ArrayList<>();
	edgesToBeRemoved.add(new Edge<>(5L, 1L, 51L));
	edgesToBeRemoved.add(new Edge<>(5L, 1L, 51L));

	graph = graph.removeEdges(edgesToBeRemoved);

	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";

	compareResultAsTuples(result, expectedResult);
}

Example 9

Source File: GraphMutationsITCase.java From flink with Apache License 2.0

5 votes

vote down

vote up

@Test
public void testRemoveOneValidOneInvalidEdge() throws Exception {
	/*
	 * Test removeEdges() -- one edge is valid, the other is invalid
	 */

	final ExecutionEnvironment env = ExecutionEnvironment.getExecutionEnvironment();

	Graph<Long, Long, Long> graph = Graph.fromDataSet(TestGraphUtils.getLongLongVertexData(env),
			TestGraphUtils.getLongLongEdgeData(env), env);
	List<Edge<Long, Long>> edgesToBeRemoved = new ArrayList<>();
	edgesToBeRemoved.add(new Edge<>(1L, 1L, 51L));
	edgesToBeRemoved.add(new Edge<>(6L, 1L, 61L));

	graph = graph.removeEdges(edgesToBeRemoved);

	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);
}