Open Sidebar
Close Sidebar
CrystalDoc.info
Source code
Shards.info
cgl
v0.2.0
CGL
AbstractDiGraph
AbstractGraph
AdjacencyDiGraph
AdjacencyGraph
AdjacencyHash
AnyEdge
AnyGraph
BFSIterator
BinaryHeap
Color
DFSIterator
DiEdge
DiGraph
Directed
DotVisitor
Edge
EdgeError
EdgeIterator
Graph
GraphError
GraphIterator
GraphSourceIterator
Labelable
LabeledDiGraph
LabeledGraph
LDiEdge
LEdge
MultiGraph
Undirected
Visitor
WDiEdge
WEdge
Weightable
WeightedDiGraph
WeightedGraph
WeightedLabeledDiGraph
WeightedLabeledGraph
Built with Crystal 1.9.2
2023-10-08 14:41:20 UTC
module
CGL::Visitor(V)
Overview
A 'Visitor' provides
Note: if you care about ordering, use an iterator instead.
Direct including types
CGL::DotVisitor(V)
Defined in:
cgl/traversal/visitor.cr
Instance Method Summary
#accept
(graph : AnyGraph(V))
#visit
(visitable)
#visit_edges?
: Bool
#visit_vertices?
: Bool
Instance Method Detail
def
accept
(graph :
AnyGraph
(V))
#
[
View source
]
abstract def
visit
(visitable)
#
[
View source
]
def
visit_edges?
: Bool
#
[
View source
]
def
visit_vertices?
: Bool
#
[
View source
]