Uses of Package
net.walend.digraph

Packages that use net.walend.digraph

net.walend.digraph

This package contains a kit for working with directed graphs.

Classes in net.walend.digraph used by net.walend.digraph

AbstractHashCEDigraph
This abstract class implements the CEDigraph interface using a Map and a Set.

AbstractHashGEDigraph
This abstract class implements the GEDigraph interface using two HashSets.

AbstractHashUEDigraph
This abstract class implements the UEDigraph interface using three HashMaps.

CEDigraph
CEDigraph is an interface for representing directed graphs of nodes linked by zero or one edge.

DigraphException

EdgeIterator
EdgeIterator extends EdgeNodeIterator by adding a method to get the current edge.

EdgeMissingException

EdgeNodeIterator
EdgeNodeIterator is a special iterator that iterates accross the pairs of nodes that make edges in a digraph.

EdgeNotUniqueException

GEDigraph
GEDigraph is an interface for representing directed graphs of nodes linked by zero or one edge.

MutableCEDigraph
MutableCEDigraph adds mutators to the CEDigraph interface so that a developer can add and remove edges and nodes.

MutableGEDigraph
MutableGEDigraph adds mutators to the GEDigraph interface so that a developer can add and remove edges and nodes.

MutableUEDigraph
MutableUEDigraph adds mutators to the UEDigraph interface so that a developer can add and remove edges and nodes.

NodeMissingException

UEDigraph
UEDigraph is an interface for representing directed graphs of nodes linked by zero or one edge.