CycleDetectionTree

Undocumented in source.

class CycleDetectionTree : Graph!(T)(

T

) {

void mark(size_t s);

void opUnary();

void opBinaryRight(size_t lhs);

bool isVisited();

bool wasCycled();

size_t getCnt();

}

Constructors

this this(T value): Constructs a new node

Members

Functions

getCnt size_t getCnt(): Undocumented in source. Be warned that the author may not have intended to support it.
isVisited bool isVisited(): Undocumented in source. Be warned that the author may not have intended to support it.
mark void mark(size_t s): Undocumented in source. Be warned that the author may not have intended to support it.
mark void mark(): Undocumented in source. Be warned that the author may not have intended to support it.
opBinaryRight void opBinaryRight(size_t lhs): Undocumented in source. Be warned that the author may not have intended to support it.
opUnary void opUnary(): Undocumented in source. Be warned that the author may not have intended to support it.
wasCycled bool wasCycled(): Undocumented in source. Be warned that the author may not have intended to support it.

Meta

Source

See Implementation

niknaks containers classes

functions

isSector

structs

templates