|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use Visitor | |
---|---|
helix.graph.algo | |
helix.graph.algo.c3part.visitor |
Uses of Visitor in helix.graph.algo |
---|
Classes in helix.graph.algo that implement Visitor | |
---|---|
class |
AbstractCCVisitor
a basic skeleton for a Visitor following the connected components (CC) of a graph note: you basically need to implement your own enter(), exit() and visit(Vertex v) methods enter() is called when entering a new CC exit() is called when finishing the current CC visit(v) is called when adding v into the current CC in addition you may override the accept(Edge edge) method to select proper edges (by default all existing edges are acceptable) |
class |
CCVisitor
|
Methods in helix.graph.algo that return Visitor | |
---|---|
Visitor |
Visitor.traverse()
|
Visitor |
AbstractCCVisitor.traverse()
components traversal return this for piping |
Uses of Visitor in helix.graph.algo.c3part.visitor |
---|
Classes in helix.graph.algo.c3part.visitor that implement Visitor | |
---|---|
class |
CCByColorsVisitor
|
class |
CCByColorVisitor
|
class |
CCByEpsilonVisitor
|
class |
CCDatagraphVisitor
|
class |
CCMultigraphVisitor
|
class |
CCStarByColorVisitor
|
class |
CCSuperStarByColorVisitor
the superstar version of CCStarByColorVisitor -1- keep red stars apart (red star is a vertex having a star on specified color) -2- compute normal CCs -3- fadd red stars as a separate CC |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |