Class JungToGDirectedGraphAdapter<V,​E extends GEdge<V>>

    • Constructor Detail

      • JungToGDirectedGraphAdapter

        public JungToGDirectedGraphAdapter​(edu.uci.ics.jung.graph.Graph<V,​E> delegate)
    • Method Detail

      • containsEdge

        public boolean containsEdge​(V from,
                                    V to)
        Description copied from interface: GDirectedGraph
        Test if the graph contains an edge from one given vertex to another
        Specified by:
        containsEdge in interface GDirectedGraph<V,​E extends GEdge<V>>
        Parameters:
        from - the source vertex
        to - the destination vertex
        Returns:
        true if such an edge exists, or false
      • emptyCopy

        public GDirectedGraph<V,​E> emptyCopy()
        Description copied from interface: GDirectedGraph
        Creates a new instance of this graph with no vertices or edges. This is useful when you wish to build a new graph using the same type as this graph.
        Specified by:
        emptyCopy in interface GDirectedGraph<V,​E extends GEdge<V>>
        Returns:
        the new copy
      • isEmpty

        public boolean isEmpty()
        Description copied from interface: GDirectedGraph
        Test if the graph is empty, i.e., contains no vertices or edges
        Specified by:
        isEmpty in interface GDirectedGraph<V,​E extends GEdge<V>>
        Returns:
        true if the graph is empty, or false
      • getEdges

        public java.util.Collection<E> getEdges()
        Description copied from interface: GDirectedGraph
        Retrieve all the edges
        Specified by:
        getEdges in interface GDirectedGraph<V,​E extends GEdge<V>>
        Returns:
        the edges
      • getVertices

        public java.util.Collection<V> getVertices()
        Description copied from interface: GDirectedGraph
        Retrieve all the vertices
        Specified by:
        getVertices in interface GDirectedGraph<V,​E extends GEdge<V>>
        Returns:
        the vertices
      • containsVertex

        public boolean containsVertex​(V vertex)
        Description copied from interface: GDirectedGraph
        Test if the graph contains a given vertex
        Specified by:
        containsVertex in interface GDirectedGraph<V,​E extends GEdge<V>>
        Parameters:
        vertex - the vertex
        Returns:
        true if the vertex is in the graph, or false
      • containsEdge

        public boolean containsEdge​(E edge)
        Description copied from interface: GDirectedGraph
        Test if the graph contains a given edge
        Specified by:
        containsEdge in interface GDirectedGraph<V,​E extends GEdge<V>>
        Parameters:
        edge - the ege
        Returns:
        true if the edge is in the graph, or false
      • getNeighbors

        public java.util.Collection<V> getNeighbors​(V vertex)
      • inDegree

        public int inDegree​(V vertex)
      • getIncidentEdges

        public java.util.Collection<E> getIncidentEdges​(V vertex)
        Description copied from interface: GDirectedGraph
        Returns all edges connected to the given vertex
        Specified by:
        getIncidentEdges in interface GDirectedGraph<V,​E extends GEdge<V>>
        Parameters:
        vertex - the vertex
        Returns:
        the edges
      • outDegree

        public int outDegree​(V vertex)
      • getIncidentVertices

        public java.util.Collection<V> getIncidentVertices​(E edge)
      • isPredecessor

        public boolean isPredecessor​(V v1,
                                     V v2)
      • isSuccessor

        public boolean isSuccessor​(V v1,
                                   V v2)
      • findEdge

        public E findEdge​(V v1,
                          V v2)
        Description copied from interface: GDirectedGraph
        Locates the edge object for the two vertices
        Specified by:
        findEdge in interface GDirectedGraph<V,​E extends GEdge<V>>
        Parameters:
        v1 - the start vertex
        v2 - the end vertex
        Returns:
        the edge
      • getPredecessorCount

        public int getPredecessorCount​(V vertex)
      • getSuccessorCount

        public int getSuccessorCount​(V vertex)
      • getSource

        public V getSource​(E directed_edge)
      • findEdgeSet

        public java.util.Collection<E> findEdgeSet​(V v1,
                                                   V v2)
      • getDest

        public V getDest​(E directed_edge)
      • isSource

        public boolean isSource​(V vertex,
                                E edge)
      • addVertex

        public boolean addVertex​(V vertex)
        Description copied from interface: GDirectedGraph
        Add a vertex
        Specified by:
        addVertex in interface GDirectedGraph<V,​E extends GEdge<V>>
        Parameters:
        vertex - the vertex
        Returns:
        true if the add was successful, false otherwise
      • isDest

        public boolean isDest​(V vertex,
                              E edge)
      • addEdge

        public boolean addEdge​(E edge,
                               java.util.Collection<? extends V> vertices)
      • addEdge

        public boolean addEdge​(E e,
                               V v1,
                               V v2)
      • addEdge

        public boolean addEdge​(E edge,
                               java.util.Collection<? extends V> vertices,
                               edu.uci.ics.jung.graph.util.EdgeType edge_type)
      • addEdge

        public boolean addEdge​(E e,
                               V v1,
                               V v2,
                               edu.uci.ics.jung.graph.util.EdgeType edgeType)
      • removeVertex

        public boolean removeVertex​(V vertex)
        Description copied from interface: GDirectedGraph
        Remove a vertex
        Specified by:
        removeVertex in interface GDirectedGraph<V,​E extends GEdge<V>>
        Parameters:
        vertex - the vertex
        Returns:
        true
      • removeVertices

        public void removeVertices​(java.lang.Iterable<V> vertices)
        Description copied from interface: GDirectedGraph
        Removes the given vertices from the graph
        Specified by:
        removeVertices in interface GDirectedGraph<V,​E extends GEdge<V>>
        Parameters:
        vertices - the vertices to remove
      • removeEdges

        public void removeEdges​(java.lang.Iterable<E> edges)
        Description copied from interface: GDirectedGraph
        Removes the given edges from the graph
        Specified by:
        removeEdges in interface GDirectedGraph<V,​E extends GEdge<V>>
        Parameters:
        edges - the edges to remove
      • getEndpoints

        public edu.uci.ics.jung.graph.util.Pair<V> getEndpoints​(E edge)
      • getOpposite

        public V getOpposite​(V vertex,
                             E edge)
      • removeEdge

        public boolean removeEdge​(E edge)
        Description copied from interface: GDirectedGraph
        Removes an edge
        Specified by:
        removeEdge in interface GDirectedGraph<V,​E extends GEdge<V>>
        Parameters:
        edge - the edge
        Returns:
        true if the graph contained the given edge
      • isNeighbor

        public boolean isNeighbor​(V v1,
                                  V v2)
      • isIncident

        public boolean isIncident​(V vertex,
                                  E edge)
      • degree

        public int degree​(V vertex)
      • getNeighborCount

        public int getNeighborCount​(V vertex)
      • getIncidentCount

        public int getIncidentCount​(E edge)
      • getEdgeType

        public edu.uci.ics.jung.graph.util.EdgeType getEdgeType​(E edge)
      • getDefaultEdgeType

        public edu.uci.ics.jung.graph.util.EdgeType getDefaultEdgeType()
      • getEdges

        public java.util.Collection<E> getEdges​(edu.uci.ics.jung.graph.util.EdgeType edge_type)
      • getEdgeCount

        public int getEdgeCount​(edu.uci.ics.jung.graph.util.EdgeType edge_type)