Package jetbrains.buildServer.util.graph

Class BaseModificationDAG

java.lang.Object

jetbrains.buildServer.util.graph.DAG<Long>

jetbrains.buildServer.util.graph.BaseModificationDAG

Direct Known Subclasses:

LinearDag, ModificationDAG, ModificationDAGInt, WrappedDAG

public abstract class BaseModificationDAG
extends DAG<Long>

Author:

dmitry.neverov

Constructor Summary

Constructors

Constructor	Description
BaseModificationDAG()

Method Summary

Modifier and Type	Method	Description
void	breadthFirstSearch(Long start, BFSVisitor<Long> visitor)	Run breadth-first search from the specified start node
void	breadthFirstSearch(Set<Long> starts, BFSVisitor<Long> visitor)
DAG<Long>	filter(Filter<Long> filter, boolean includeAcceptedNodeParents, boolean extrapolateEdges)
List<Long>	getCommonAncestors(List<Long> nodes)	Get list of common ancestors for collection of graph nodes
ModificationDagDFS	getDepthFirstSearch(Long start, DFSVisitor<Long> visitor)	Returns depth-first search from the specified start node
abstract long	getMaxNode()
List<Long>	getNodesWithoutChildren()	Returns nodes without children
DepthFirstSearch<Long>	getReverseDepthFirstSearch(Long start, DFSVisitor<Long> visitor)
DAGIterator<Long>	iterator()	Get iterator through the nodes of the graph.
DAGIterator<Long>	iterator(Long startNode)	Get iterator through the nodes of the graph
DAGIterator<Long>	iterator(Collection<Long> startNodes)	Get iterator through the nodes of the graph
void	reverseBreadthFirstSearch(Long start, BFSVisitor<Long> visitor)
void	reverseBreadthFirstSearch(Set<Long> starts, BFSVisitor<Long> visitor)
int	tailSize()
protected List<Long>	toposortFrom(Collection<Long> tips)

Methods inherited from class jetbrains.buildServer.util.graph.DAG

containsNode, depthFirstSearch, ensureContainsNode, exclude, fillSelfChildren, filter, filter, getAllNodes, getChildren, getCommonAncestors, getNodesWithMissingParents, getNodesWithoutParents, getParents, getSelfParents, hasParents, include, include, isEmpty, processNodesWithoutChildren, size, splitIsolatedDAGs, toposort

Methods inherited from class java.lang.Object

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

Constructor Detail

BaseModificationDAG

public BaseModificationDAG()

Method Detail

iterator

@NotNull
public DAGIterator<Long> iterator()

Description copied from class: DAG

Get iterator through the nodes of the graph. Same as iterator(getNodesWithoutChildren())

Overrides:

iterator in class DAG<Long>

Returns:

see above

See Also:

DAG.iterator(java.util.Collection)

iterator

@NotNull
public DAGIterator<Long> iterator(@NotNull
                                  Long startNode)

Description copied from class: DAG

Get iterator through the nodes of the graph

Overrides:

iterator in class DAG<Long>

Parameters:

startNode - start node for iteration

Returns:

see above

iterator

@NotNull
public DAGIterator<Long> iterator(@NotNull
                                  Collection<Long> startNodes)

Description copied from class: DAG

Get iterator through the nodes of the graph

Overrides:

iterator in class DAG<Long>

Parameters:

startNodes - start nodes for iteration

Returns:

see above

filter

public DAG<Long> filter(@NotNull
                        Filter<Long> filter,
                        boolean includeAcceptedNodeParents,
                        boolean extrapolateEdges)

Specified by:

filter in class DAG<Long>

toposortFrom

@NotNull
protected List<Long> toposortFrom(@NotNull
                                  Collection<Long> tips)

breadthFirstSearch

public void breadthFirstSearch(@NotNull
                               Long start,
                               @NotNull
                               BFSVisitor<Long> visitor)

Description copied from class: DAG

Run breadth-first search from the specified start node

Specified by:

breadthFirstSearch in class DAG<Long>

Parameters:

start - start node for the search

visitor - visitor

breadthFirstSearch

public void breadthFirstSearch(@NotNull
                               Set<Long> starts,
                               @NotNull
                               BFSVisitor<Long> visitor)

Specified by:

breadthFirstSearch in class DAG<Long>

reverseBreadthFirstSearch

public void reverseBreadthFirstSearch(@NotNull
                                      Long start,
                                      @NotNull
                                      BFSVisitor<Long> visitor)

Specified by:

reverseBreadthFirstSearch in class DAG<Long>

reverseBreadthFirstSearch

public void reverseBreadthFirstSearch(@NotNull
                                      Set<Long> starts,
                                      @NotNull
                                      BFSVisitor<Long> visitor)

Specified by:

reverseBreadthFirstSearch in class DAG<Long>

getDepthFirstSearch

public ModificationDagDFS getDepthFirstSearch(@NotNull
                                              Long start,
                                              @NotNull
                                              DFSVisitor<Long> visitor)

Description copied from class: DAG

Returns depth-first search from the specified start node

Specified by:

getDepthFirstSearch in class DAG<Long>

Parameters:

start - start node for the search

visitor - visitor

Returns:

see above

getReverseDepthFirstSearch

public DepthFirstSearch<Long> getReverseDepthFirstSearch(@NotNull
                                                         Long start,
                                                         @NotNull
                                                         DFSVisitor<Long> visitor)

Specified by:

getReverseDepthFirstSearch in class DAG<Long>

getCommonAncestors

@NotNull
public List<Long> getCommonAncestors(@NotNull
                                     List<Long> nodes)

Description copied from class: DAG

Get list of common ancestors for collection of graph nodes

Specified by:

getCommonAncestors in class DAG<Long>

Parameters:

nodes - nodes of interest, they should be presented in the graph

Returns:

least common ancestors or empty list if collection of nodes is empty or if there is no common ancestor between nodes.

getNodesWithoutChildren

@NotNull
public List<Long> getNodesWithoutChildren()

Description copied from class: DAG

Returns nodes without children

Specified by:

getNodesWithoutChildren in class DAG<Long>

Returns:

see above

tailSize

public int tailSize()

getMaxNode

public abstract long getMaxNode()

Returns:

max node from the current DAG if it is not empty, otherwise returns 0

Since:

2024.12