Optimize data structure for visited edges
Comments on data structure
Graph should require 'set' for `#adjacent_vertex_set`
Extract class DirectedEdgeSet
Focusing on sizes 90 .. 100
Organize benchmarks
Remove debug logging

Ruby method dispatch is too expensive to keep logging in place
Compare result to V ^ 3 (cube of graph size)