com.ibm.wala.util.graph

Interface NodeManager<T>

Type Parameters:

T - the type of nodes this NodeManager tracks.

All Superinterfaces:

Iterable<T>

All Known Subinterfaces:

Graph<T>, LabeledGraph<T,U>, NumberedGraph<T>, NumberedLabeledGraph<T,I>, NumberedNodeManager<T>, OrderedMultiGraph<T>, SerializableGraph<T>

All Known Implementing Classes:

AbstractGraph, AbstractLabeledGraph, AbstractNumberedGraph, AbstractNumberedLabeledGraph, BasicGraph, BasicNodeManager, BasicOrderedMultiGraph, DelegatingGraph, DelegatingNumberedGraph, DelegatingNumberedNodeManager, EdgeFilteredNumberedGraph, ExtensionGraph, InvertedGraph, InvertedNumberedGraph, SelfLoopAddedGraph, SlowNumberedNodeManager, SlowSparseNumberedGraph, SlowSparseNumberedLabeledGraph, SparseNumberedGraph

public interface NodeManager<T>
extends Iterable<T>

An object which tracks graph nodes.

This is effectively a stripped-down collection interface. We choose to avoid using the full Collection interface, so that it takes less code to implement a new NodeManager.

Method Summary

Modifier and Type	Method and Description
void	addNode(T n) add a node to this graph
boolean	containsNode(T n)
int	getNumberOfNodes()
default Iterator<T>	iterator()
void	removeNode(T n) remove a node from this graph
Stream<T>	stream()

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Method Detail

iterator

default Iterator<T> iterator()

Specified by:

iterator in interface Iterable<T>

Returns:

an Iterator of the nodes in this graph

stream

Stream<T> stream()

Returns:

a Stream of the nodes in this graph

getNumberOfNodes

int getNumberOfNodes()

Returns:

the number of nodes in this graph

addNode

void addNode(T n)

add a node to this graph

removeNode

void removeNode(T n)
         throws UnsupportedOperationException

remove a node from this graph

Throws:

UnsupportedOperationException

containsNode

boolean containsNode(T n)

Returns:

true iff the graph contains the specified node