class CGL::DFSIterator(V)

Overview

A DFSIterator can be used to traverse a graph from a given vertex V in a Depth-first search fashion.

Defined in:

cgl/traversal/depth_first_search.cr

Constructors

.new(graph : AnyGraph(V), start : V, *, colors : Hash(V, Color)? = nil)

Instance methods inherited from class `CGL::GraphSourceIterator(V)`

,

Constructor methods inherited from class `CGL::GraphSourceIterator(V)`

Constructor Detail

def self.new(graph : AnyGraph(V), start : V, *, colors : Hash(V, Color)? = nil) #