[m-rev.] for review: .local_call_tree_full

[Zoltan Somogyi]

On 2024-02-29 21:06 +11:00 AEDT, "Julien Fischer" <jfischer at opturion.com> wrote:
>>  % This module defines a data type representing directed graphs. A directed
>>  % graph of type digraph(T) is logically equivalent to a set of vertices of
>>  % type T, and a set of edges of type pair(T). The endpoints of each edge
>> -% must be included in the set of vertices; cycles and loops are allowed.
>> +% must be included in the set of vertices; cycles are allowed.
> 
> I would prefer the wording to be explicit about the fact that loops are allowed,
> since that is not always the case with graphs. Perhaps:
> 
>     cycles, including loops, are allowed.
> 
> ?

What's the difference? To me, "cycle" and "loop" are synonyms.

> The rest looks fine.

Thank you.

Zoltan.