Range-Based Graph Search in D (blog post)

[Peter Alexander]

On Thursday, 9 January 2014 at 22:53:02 UTC, qznc wrote:
> For the visitation API design: Your map approach (bool[Vertex] 
> m_visited) is probably the most generic one.
>
> A variant, where the nodes store the flag internally is more 
> efficient, though.

Unless the graph is infinite ;-)

But yes, for most graphs that would likely be more efficient than 
a hash lookup. I'll keep note of that. Thanks!