Package jetbrains.buildServer.util.graph

Class EmptyLinearDag

java.lang.Object

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

jetbrains.buildServer.util.graph.BaseModificationDAG

jetbrains.buildServer.util.graph.LinearDag

jetbrains.buildServer.util.graph.EmptyLinearDag

public class EmptyLinearDag
extends LinearDag

Author:

dmitry.neverov

Constructor Summary

Constructors

Constructor	Description
EmptyLinearDag()

Method Summary

Modifier and Type	Method	Description
boolean	containsNode(Long node)	Check if graph contains specified node
protected void	fillSelfChildren(Long node, List<Long> accumulator)
Set<Long>	getAllNodes()
List<Long>	getNodesWithoutChildren()	Returns nodes without children
List<Long>	getNodesWithoutParents()	Returns nodes without parents
List<Long>	getParents(Long node)	Get parents of the specified node
protected List<Long>	getSelfParents(Long node)
int	size()	Returns number of nodes in the graph
List<Long>	toposort()	Get topologically sorted list of graph nodes (parents go before children)

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

getMaxNode, processNodesWithoutChildren

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

breadthFirstSearch, breadthFirstSearch, filter, getCommonAncestors, getDepthFirstSearch, getReverseDepthFirstSearch, iterator, iterator, iterator, reverseBreadthFirstSearch, reverseBreadthFirstSearch, tailSize, toposortFrom

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

depthFirstSearch, ensureContainsNode, exclude, filter, filter, getChildren, getCommonAncestors, getNodesWithMissingParents, hasParents, include, include, isEmpty, splitIsolatedDAGs

Methods inherited from class java.lang.Object

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

Constructor Detail

EmptyLinearDag

public EmptyLinearDag()

Method Detail

toposort

@NotNull
public List<Long> toposort()

Description copied from class: DAG

Get topologically sorted list of graph nodes (parents go before children)

Specified by:

toposort in class DAG<Long>

Returns:

see above

getParents

@NotNull
public List<Long> getParents(@NotNull
                             Long node)

Description copied from class: DAG

Get parents of the specified node

Specified by:

getParents in class DAG<Long>

Parameters:

node - node of interest

Returns:

see above

getSelfParents

@Nullable
protected List<Long> getSelfParents(@NotNull
                                    Long node)

Specified by:

getSelfParents in class DAG<Long>

fillSelfChildren

protected void fillSelfChildren(@NotNull
                                Long node,
                                @NotNull
                                List<Long> accumulator)

Specified by:

fillSelfChildren in class DAG<Long>

containsNode

public boolean containsNode(@NotNull
                            Long node)

Description copied from class: DAG

Check if graph contains specified node

Specified by:

containsNode in class DAG<Long>

Parameters:

node - node to check

Returns:

true if graph contains node, false otherwise

getNodesWithoutParents

@NotNull
public List<Long> getNodesWithoutParents()

Description copied from class: DAG

Returns nodes without parents

Specified by:

getNodesWithoutParents in class DAG<Long>

Returns:

see above

getNodesWithoutChildren

@NotNull
public List<Long> getNodesWithoutChildren()

Description copied from class: DAG

Returns nodes without children

Overrides:

getNodesWithoutChildren in class BaseModificationDAG

Returns:

see above

size

public int size()

Description copied from class: DAG

Returns number of nodes in the graph

Specified by:

size in class DAG<Long>

Returns:

see above

getAllNodes

@NotNull
public Set<Long> getAllNodes()

Specified by:

getAllNodes in class DAG<Long>