Re: Simple Components (Generic_Directed_Graph)

[Victor Porton <porton@narod.ru>]

Dmitry A. Kazakov wrote:

> On 2017-10-30 11:41, Victor Porton wrote:
> 
>> I do not understand your logic in Generic_Directed_Graph:
>> 
>> The procedures like
>> 
>> procedure Disconnect (Parent : Node; Child : Node);
>> 
>> do not take "Graph" argument.
> 
> A graph consists of connected nodes. Each node is in and a graph.
> 
>> Does it mean that there exists just one graph (per instantiation)?
> 
> No. If two nodes are mutually unreachable you have two graphs.
> 
>> This looks wrong for me. First it is using global variables.
> 
> It uses referential semantics. Node is an access type to the type you
> pass to the package when you instantiate it. E.g. if you want a graph of
> Strings you instantiate the package with String. Then Node is a pointer
> to string.

I also do not understand, when nodes are finalized. Please explain.

> The notion of scope does not really applied to the structures like
> graph. You can scope the pool you pass to the instance. You can scope
> nodes with some logic attached when a node leaves its scope. But
> otherwise it makes little sense to talk about the scope of a graph.
> 
-- 
Victor Porton - http://portonvictor.org