Hi,

"Dr. Arne Babenhauserheide" <xxxxxx@web.de> writes:
> one topic that came up in the discussion about finishing topological
> sorting is to provide a way to calculate the strongly connected
> components.
>
> How should we represent these?

I would personally prefer a function that computes the strongly
connected components as lists of vertices '((0 1 2) (3 4) (5 6) (7)) (or
as sets of vertices), though there may be value in providing both such a
function and a function that computes '(0 0 0 3 3 5 5 7).

It'd also be great if there were a way to compute connected components,
but that may be out of scope for this srfi

That brings me to another, semi-related question: are there (pre)srfis
to convert between / abstract over different representations and types
of graphs?  I was unable to find anything with some cursory googling,
but it seems like something like that could be quite useful

And finally: Would creating a "comparator" (as in srfi 128) of the
generated order fall within the scope of this srfi?

Kind regards,
Jakob