Package ghidra.graph.jung

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

  • All Implemented Interfaces:
    edu.uci.ics.jung.graph.DirectedGraph<V,​E>, edu.uci.ics.jung.graph.Graph<V,​E>, edu.uci.ics.jung.graph.Hypergraph<V,​E>, GDirectedGraph<V,​E>, java.io.Serializable
    Direct Known Subclasses:
    JungDirectedVisualGraph
    public class JungDirectedGraph<V,​E extends GEdge<V>>
extends edu.uci.ics.jung.graph.DirectedSparseGraph<V,​E>
implements GDirectedGraph<V,​E>
    See Also:
    Serialized Form

    • Field Summary

      • Fields inherited from class edu.uci.ics.jung.graph.DirectedSparseGraph

        edges, vertices

      • Fields inherited from class edu.uci.ics.jung.graph.AbstractTypedGraph

        edge_type

    • Method Summary

      All Methods Instance Methods Concrete Methods 
      Modifier and Type Method Description
      void addEdge​(E e)
      Add an edge
      boolean containsEdge​(V from, V to)
      Test if the graph contains an edge from one given vertex to another
      GDirectedGraph<V,​E> copy()
      Copy this graph.
      GDirectedGraph<V,​E> emptyCopy()
      Creates a new instance of this graph with no vertices or edges.
      boolean isEmpty()
      Test if the graph is empty, i.e., contains no vertices or edges
      void removeEdges​(java.lang.Iterable<E> toRemove)
      Removes the given edges from the graph
      void removeVertices​(java.lang.Iterable<V> toRemove)
      Removes the given vertices from the graph

      • Methods inherited from class edu.uci.ics.jung.graph.DirectedSparseGraph

        addEdge, addVertex, containsEdge, containsVertex, findEdge, findEdgeSet, getDest, getEdgeCount, getEdges, getEndpoints, getFactory, getIncidentEdges, getIncoming_internal, getInEdges, getNeighbors, getOutEdges, getOutgoing_internal, getPredecessors, getPreds_internal, getSource, getSuccessors, getSuccs_internal, getVertexCount, getVertices, isDest, isSource, removeEdge, removeVertex

      • Methods inherited from class edu.uci.ics.jung.graph.AbstractTypedGraph

        getDefaultEdgeType, getEdgeCount, getEdges, getEdgeType, hasEqualEdgeType, validateEdgeType

      • Methods inherited from class edu.uci.ics.jung.graph.AbstractGraph

        addEdge, addEdge, addEdge, addEdge, addEdge, degree, getIncidentCount, getIncidentVertices, getNeighborCount, getOpposite, getPredecessorCount, getSuccessorCount, getValidatedEndpoints, inDegree, isIncident, isNeighbor, isPredecessor, isSuccessor, outDegree, toString

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

      • Methods inherited from interface edu.uci.ics.jung.graph.Graph

        addEdge, addEdge, getOpposite, getPredecessorCount, getSuccessorCount, inDegree, isPredecessor, isSuccessor, outDegree

      • Methods inherited from interface edu.uci.ics.jung.graph.Hypergraph

        addEdge, addEdge, degree, getDefaultEdgeType, getEdgeCount, getEdges, getEdgeType, getIncidentCount, getIncidentVertices, getNeighborCount, isIncident, isNeighbor

    • Constructor Detail

      • JungDirectedGraph

        public JungDirectedGraph()

    • Method Detail

      • removeVertices

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

      • removeEdges

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

      • 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

      • copy

        public GDirectedGraph<V,​E> copy()
        Description copied from interface: GDirectedGraph
        Copy this graph.

        Note: the vertices and edges in the copy may be the same instances in the new graph and not themselves copies.

        Specified by:
        copy 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