/** @deprecated Use {@link #addEdge(Object, Object, Object...)}. */ @Deprecated public E addEdge(V vertex, V targetVertex) { return super.addEdge(vertex, targetVertex); }
private DefaultDirectedGraph<String, DefaultEdge> createDag() { // A - B - C - D // \ / // +- E - F final DefaultDirectedGraph<String, DefaultEdge> graph = DefaultDirectedGraph.create(); graph.addVertex("A"); graph.addVertex("B"); graph.addVertex("C"); graph.addVertex("D"); graph.addVertex("E"); graph.addVertex("F"); graph.addEdge("A", "B"); graph.addEdge("B", "C"); graph.addEdge("C", "D"); graph.addEdge("A", "E"); graph.addEdge("E", "C"); graph.addEdge("E", "F"); return graph; }
private DefaultDirectedGraph<String, DefaultEdge> createDag() { // A - B - C - D // \ / // +- E - F final DefaultDirectedGraph<String, DefaultEdge> graph = DefaultDirectedGraph.create(); graph.addVertex("A"); graph.addVertex("B"); graph.addVertex("C"); graph.addVertex("D"); graph.addVertex("E"); graph.addVertex("F"); graph.addEdge("A", "B"); graph.addEdge("B", "C"); graph.addEdge("C", "D"); graph.addEdge("A", "E"); graph.addEdge("E", "C"); graph.addEdge("E", "F"); return graph; }
graph.addEdge("D", "E"); assertThat(new CycleDetector<String, DefaultEdge>(graph).findCycles(), CoreMatchers.equalTo( graph.addEdge("D", "C"); assertThat(new CycleDetector<String, DefaultEdge>(graph).findCycles(), CoreMatchers.equalTo( graph.addEdge("C", "B"); graph.addEdge("C", "C"); assertThat(new CycleDetector<String, DefaultEdge>(graph).findCycles(), CoreMatchers.equalTo(
graph.addEdge("D", "E"); assertThat(new CycleDetector<String, DefaultEdge>(graph).findCycles(), CoreMatchers.equalTo( graph.addEdge("D", "C"); assertThat(new CycleDetector<String, DefaultEdge>(graph).findCycles(), CoreMatchers.equalTo( graph.addEdge("C", "B"); graph.addEdge("C", "C"); assertThat(new CycleDetector<String, DefaultEdge>(graph).findCycles(), CoreMatchers.equalTo(