Re: [Chicken-users] New eggs: digraph, graph-dfs, graph-bfs, graph-scc, graph-cycles

[Ivan Raikov]

  Great, let me know how this graph implementation works out for
you. I do have to admit that I did not fully understand why the Boost
graph library goes through all the complicated things that it does
just to construct a graph object. The eggs I just created still allow
for different graph representations to be used interchangeably, but I
believe they do not suffer from the very complex dependencies that
seem to exist between graph representation and graph algorithms in
rgraph.

  -Ivan

address@hidden writes:

>
> Wow, is that good timing!  I've been doing a lot of stuff with graphs
> lately.  I look forward to testing it out.
>
> This seems to be trend with descendants of the Boost graph library.
> It's just the sort of highly abstract design that makes computer
> scientists feel all warm and fuzzy inside, and yet the abstraction
> itself ends up making the whole thing too complicated ("All I want to
> do is . . .").  Exactly the same thing happened with the Ruby versions
> of the Boost graph bindings.  Ruby port of Boost graph, followed by
> a version with a vastly simplified interface.
>
> Steve