@Test public void isCyclic() { DirectedAcyclicGraph<String> graph = new DirectedAcyclicGraph<String>(); assertFalse(graph.isCyclic()); }
@Override public boolean isCyclic() { return false; }
DirectedAcyclicGraph implements Graph<T> { @Override public boolean isCyclic() { return false; } }
DirectedAcyclicGraph implements Graph<T> { @Override public boolean isCyclic() { return false; } DirectedAcyclicGraph(); }
DirectedAcyclicGraph implements Graph<T> { @Override public boolean isCyclic() { return false; } DirectedAcyclicGraph(); @Override Vertex<T> addVertex(T of); @Override void addEdge(Vertex<T> from, Vertex<T> to); @Override void removeEdge(Vertex<T> from, Vertex<T> to); @Override Vertex<T> getVertex(T of); @Override boolean hasVertex(T of); @Override boolean hasEdge(Vertex<T> from, Vertex<T> to); @Override boolean isCyclic(); @Override List<Vertex<T>> getVertices(); @Override List<Vertex<T>> getRootVertices(); @Override String toString(); }
DirectedAcyclicGraph implements Graph<T> { @Override public boolean isCyclic() { return false; } DirectedAcyclicGraph(); @Override Vertex<T> addVertex(T of); @Override void addEdge(Vertex<T> from, Vertex<T> to); @Override void removeEdge(Vertex<T> from, Vertex<T> to); @Override Vertex<T> getVertex(T of); @Override boolean hasVertex(T of); @Override boolean hasEdge(Vertex<T> from, Vertex<T> to); @Override boolean isCyclic(); @Override List<Vertex<T>> getVertices(); @Override List<Vertex<T>> getRootVertices(); @Override String toString();  }