Class ConfigurableValueGraph<N,​V>

    • Field Detail

      • isDirected

        private final boolean isDirected
      • allowsSelfLoops

        private final boolean allowsSelfLoops
      • edgeCount

        protected long edgeCount
    • Constructor Detail

      • ConfigurableValueGraph

        ConfigurableValueGraph​(AbstractGraphBuilder<? super N> builder)
        Constructs a graph with the properties specified in builder.
      • ConfigurableValueGraph

        ConfigurableValueGraph​(AbstractGraphBuilder<? super N> builder,
                               java.util.Map<N,​GraphConnections<N,​V>> nodeConnections,
                               long edgeCount)
        Constructs a graph with the properties specified in builder, initialized with the given node map.
    • Method Detail

      • nodes

        public java.util.Set<N> nodes()
        Description copied from interface: ValueGraph
        Returns all nodes in this graph, in the order specified by ValueGraph.nodeOrder().
      • isDirected

        public boolean isDirected()
        Description copied from interface: ValueGraph
        Returns true if the edges in this graph are directed. Directed edges connect a source node to a target node, while undirected edges connect a pair of nodes to each other.
      • allowsSelfLoops

        public boolean allowsSelfLoops()
        Description copied from interface: ValueGraph
        Returns true if this graph allows self-loops (edges that connect a node to itself). Attempting to add a self-loop to a graph that does not allow them will throw an IllegalArgumentException.
      • adjacentNodes

        public java.util.Set<N> adjacentNodes​(N node)
        Description copied from interface: ValueGraph
        Returns the nodes which have an incident edge in common with node in this graph.
      • predecessors

        public java.util.Set<N> predecessors​(N node)
        Description copied from interface: ValueGraph
        Returns all nodes in this graph adjacent to node which can be reached by traversing node's incoming edges against the direction (if any) of the edge.

        In an undirected graph, this is equivalent to ValueGraph.adjacentNodes(Object).

      • successors

        public java.util.Set<N> successors​(N node)
        Description copied from interface: ValueGraph
        Returns all nodes in this graph adjacent to node which can be reached by traversing node's outgoing edges in the direction (if any) of the edge.

        In an undirected graph, this is equivalent to ValueGraph.adjacentNodes(Object).

        This is not the same as "all nodes reachable from node by following outgoing edges". For that functionality, see Graphs.reachableNodes(Graph, Object).

      • hasEdgeConnecting

        public boolean hasEdgeConnecting​(N nodeU,
                                         N nodeV)
        Description copied from interface: BaseGraph
        Returns true if there is an edge directly connecting nodeU to nodeV. This is equivalent to nodes().contains(nodeU) && successors(nodeU).contains(nodeV).

        In an undirected graph, this is equal to hasEdgeConnecting(nodeV, nodeU).

        Specified by:
        hasEdgeConnecting in interface BaseGraph<N>
        Specified by:
        hasEdgeConnecting in interface ValueGraph<N,​V>
        Overrides:
        hasEdgeConnecting in class AbstractBaseGraph<N>
      • edgeValueOrDefault

        public V edgeValueOrDefault​(N nodeU,
                                    N nodeV,
                                    V defaultValue)
        Description copied from interface: ValueGraph
        Returns the value of the edge connecting nodeU to nodeV, if one is present; otherwise, returns defaultValue.

        In an undirected graph, this is equal to edgeValueOrDefault(nodeV, nodeU, defaultValue).

      • edgeCount

        protected long edgeCount()
        Description copied from class: AbstractBaseGraph
        Returns the number of edges in this graph; used to calculate the size of AbstractBaseGraph.edges(). This implementation requires O(|N|) time. Classes extending this one may manually keep track of the number of edges as the graph is updated, and override this method for better performance.
        Overrides:
        edgeCount in class AbstractBaseGraph<N>
      • containsNode

        protected final boolean containsNode​(N node)