class Crystalline::Graph::GraphIterator(T)

Direct Known Subclasses

Defined in:

graph/traversal.cr

Constructors

Instance Method Summary

Instance methods inherited from class Crystalline::Graph::GraphVisitor(T)

color_map : Hash(T, Mark) color_map, follow_edge?(u, v) follow_edge?, graph graph, reset reset

Constructor methods inherited from class Crystalline::Graph::GraphVisitor(T)

new new

Instance methods inherited from class Crystalline::Graph::AbstractIterator(T)

at_beginning? at_beginning?, at_end? at_end?, backward backward, current current, current_edge current_edge, each(&) each, empty? empty?, first first, forward forward, last last, move_backward_until(&) move_backward_until, move_forward_until(&) move_forward_until, peek peek, set_to_begin set_to_begin, set_to_end set_to_end

Constructor Detail

def self.new #

[View source]

Instance Method Detail

def at_beginning? #

[View source]
def at_end? #

[View source]
def back_edge_event : Proc(T, T, Nil) | Nil #

[View source]
def back_edge_event=(back_edge_event : Proc(T, T, Nil) | Nil) #

[View source]
def basic_backward #

[View source]
def basic_forward #

[View source]
def edge_event : Proc(T, T, Nil) | Nil #

[View source]
def edge_event=(edge_event : Proc(T, T, Nil) | Nil) #

[View source]
def finish_vertex_event : Proc(T, Nil) | Nil #

[View source]
def finish_vertex_event=(finish_vertex_event : Proc(T, Nil) | Nil) #

[View source]
def forward_edge_event : Proc(T, T, Nil) | Nil #

[View source]
def forward_edge_event=(forward_edge_event : Proc(T, T, Nil) | Nil) #

[View source]
def set_to_begin #

[View source]
def start_vertex #

[View source]
def tree_edge_event : Proc(T, T, Nil) | Nil #

[View source]
def tree_edge_event=(tree_edge_event : Proc(T, T, Nil) | Nil) #

[View source]
def vertex_event : Proc(T, Nil) | Nil #

[View source]
def vertex_event=(vertex_event : Proc(T, Nil) | Nil) #

[View source]