[plt-scheme] Graphs

(require "base-gm.ss")

You have only this require. Which file is this?

Cheers,

Paulo Matos

Guillaume Marceau said:
> On Tue, 2005-02-08 at 16:26 +0000, Paulo Jorge de Oliveira
> Cantante de
> Matos wrote:
>>   For list-related administrative tasks:
>>   http://list.cs.brown.edu/mailman/listinfo/plt-scheme
>>
>> Hi all,
>>
>> Is there any implementation of graphs structures and
>> algorithms
>> that work under MzScheme?
>>
>> Cheers,
>
> I attached my implementation of a graph data structure.
>
> It implements imperative graphs, backed with hash tables. Nodes
> are
> arbitrary objects, and they are compared using either EQ? or
> EQUAL?
>
> Graphs can be directed or undirected. The graphs can throw an
> exception
> for nodes added multiple times, edge added multiple times, and
> edges
> added between objects that are not in the graph. You can enable
> the
> checks by passing the flag 'SAFE to the constructor.
>
> Both nodes and edges can have arbitrary labels.
>
> There are only three algorithms coded so far: dfs, topological
> sort, and
> strongly connected components.
>
>
> --
> "The thing I remember most about America is that it's silly.
>  That can be quite a relief at times."  -- Thom Yorke,
> Radiohead
>
> - Guillaume
>


-- 
Paulo Jorge Matos - pocm at sat inesc-id pt
Engº de Informática e Computadores
INESC-ID - Grupo SAT - MathSAT