Interface DiGraph.DiGraphNode<N,E>

Type Parameters:
N - Value type that the graph node stores.
E - Value type that the graph edge stores.
All Superinterfaces:
Annotatable, GraphNode<N,E>
All Known Implementing Classes:
LinkedDirectedGraph.LinkedDiGraphNode
Enclosing class:
DiGraph<N,E>

public static interface DiGraph.DiGraphNode<N,E> extends GraphNode<N,E>
A generic directed graph node.
  • Method Details Link icon

    • getOutEdges Link icon

      List<? extends DiGraph.DiGraphEdge<N,E>> getOutEdges()
    • getInEdges Link icon

      List<? extends DiGraph.DiGraphEdge<N,E>> getInEdges()
    • hasPriority Link icon

      boolean hasPriority()
      Returns whether a priority has been set.
    • getPriority Link icon

      int getPriority()
      Returns a nonnegative integer priority which can be used to order nodes.

      Throws if a priority has not been set.

    • setPriority Link icon

      void setPriority(int priority)
      Sets a node priority, must be non-negative.