graph

Class Graph.SubGraphs

java.lang.Object

la.util.Series

graph.Graph.SubGraphs

Enclosing class:

Graph

public class Graph.SubGraphs
extends Series

A Series of lo- to hi-sized, (weakly-) connected, Induced subGraphs of 'this' Graph. Note, 'lo' to 'hi' inclusive. Also see Graph.subGraphs(int,int).

Nested Class Summary

Nested classes/interfaces inherited from class la.util.Series

Series.Discrete, Series.Int, Series.Lines, Series.Range, Series.Separator

Field Summary

Fields

Modifier and Type	Field and Description
int	hi subGraphs of Vertex-size lo to hi inclusive.
int	lo subGraphs of Vertex-size lo to hi inclusive.

Fields inherited from class la.util.Series

EMPTY

Constructor Summary

Constructors

Constructor and Description
SubGraphs(int lo, int hi) lo and hi inclusive are bounds on the vertex-size of the subGraphs in the Series.

Method Summary

Modifier and Type	Method and Description
void	advance() Move on to the next subGraph in the Series.
Graph.Induced	elt() Return the current subGraph in 'this' Series if hasSome().
boolean	hasSome() Is there at least a current Graph remaining in the Series?
int	position() Return the position, p, of the current subGraph in the Series, or how many were generated if hasNone().
java.util.BitSet	vertices() Return the set of Vertices (of 'this' Graph) that are in the current subGraph of 'this' Series.

Methods inherited from class la.util.Series

advance, advanceTo, append, asList, error, exhaust, fromInts, fromVector, hasNone, main, merge, merge, singleton, toString, values, wt

Methods inherited from class java.lang.Object

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

Field Detail

lo

public final int lo

subGraphs of Vertex-size lo to hi inclusive.

hi

public final int hi

subGraphs of Vertex-size lo to hi inclusive.

Constructor Detail

SubGraphs

public SubGraphs(int lo,
                 int hi)

lo and hi inclusive are bounds on the vertex-size of the subGraphs in the Series.

Method Detail

hasSome

public boolean hasSome()

Is there at least a current Graph remaining in the Series?

Specified by:

hasSome in class Series

position

public int position()

Return the position, p, of the current subGraph in the Series, or how many were generated if hasNone(). Counting starts at zero.

Specified by:

position in class Series

elt

public Graph.Induced elt()

Return the current subGraph in 'this' Series if hasSome(). After advance(), a different (disjoint) data-structure will be returned although the current and next subGraphs may well overlap.

Specified by:

elt in class Series

vertices

public java.util.BitSet vertices()

Return the set of Vertices (of 'this' Graph) that are in the current subGraph of 'this' Series. Beware: The result BitSet is changed by advance(). And on no account change its contents!

advance

public void advance()

Move on to the next subGraph in the Series. If there are no more elt() becomes invalid.

Specified by:

advance in class Series