Package org.gbif.api.model.pipelines

Class PipelinesWorkflow.Graph<T>

java.lang.Object
org.gbif.api.model.pipelines.PipelinesWorkflow.Graph<T>
Enclosing class:
PipelinesWorkflow
public static class PipelinesWorkflow.Graph<T> extends Object

  • Constructor Details

  • Method Details

    • getNodesQuantity

      public int getNodesQuantity()

    • getNodeEdges

      public List<PipelinesWorkflow.Graph<T>.Edge> getNodeEdges(T node)

    • getAllNodes

      public Set<T> getAllNodes()

    • getAllNodesFor

      public Set<T> getAllNodesFor(Set<T> fromTypesSet)

    • getLevel

      @Deprecated public int getLevel(T t)
      Deprecated.
      Returns the depth level of a node in the workflow graph, calculated relative to the insertion order of edges in the static graph initializer.

      Deprecated: This method is fundamentally unreliable for graphs with multiple entry points, as there is no globally meaningful notion of depth in a directed acyclic graph with more than one root. The level of a node is only well-defined relative to a specific starting node, and will produce incorrect or inconsistent results when new entry points are added to the graph.

      Use getRootNodesFor(Set) to determine which steps should be triggered first from a given set of requested steps. For execution history and step ordering, prefer deriving state from the persisted execution record in the registry rather than from static level arithmetic.

      Parameters:
      t - the node to look up
      Returns:
      the computed depth level of the node, unreliable in multi-root graphs

    • getRootNodesFor

      public Set<T> getRootNodesFor(Set<T> fromTypesSet)