org.stekikun.dolmen.common

Interface SCC.Graph<Node>

Type Parameters:

Node - the type of nodes in the graph

All Known Implementing Classes:

PGrammars.Dependencies

Enclosing class:

SCC<Node>

public static interface SCC.Graph<Node>

Interface describing a directed graph whose vertices can be indexed by integers.

It is used to describe the input to the SCC class which computes the strongly-connected components of the graph. The index(Object) method should be fast.

Author:

Stéphane Lescuyer

Method Summary

Modifier and Type	Method and Description
int	index(Node n) Each node must have a unique index, i.e. for every index 0 <= i < size(), there must be some node n such that index(n) = i.
void	iter(Consumer<Node> f) Applies the function f to all the nodes in the graph, in no particular order
int	size()
void	successors(Node n, Consumer<Node> f) Applies the function f to all the successors of the node n, in no particular order

Method Detail

size

int size()

Returns:

the number of nodes in the graph

index

int index(Node n)

Each node must have a unique index, i.e. for every index 0 <= i < size(), there must be some node n such that index(n) = i.

Parameters:

n -

Returns:

the index of node n, which must be between 0 and size() - 1

Throws:

NoSuchElementException - if the node is not in the graph

successors

void successors(Node n,
                Consumer<Node> f)

Applies the function f to all the successors of the node n, in no particular order

Parameters:

n -

f -

Throws:

NoSuchElementException - if the node is not in the graph

iter

void iter(Consumer<Node> f)

Applies the function f to all the nodes in the graph, in no particular order

Parameters:

f -