Re: Simple Components (Generic_Directed_Graph)

["Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>]

On 2017-10-30 15:58, Victor Porton wrote:

> What's about having multiple graphs for the situation if when A and B are of
> type T then A=B implies A'Access=B'Access?

I don't see how you could create such thing in Ada.

> Maybe it's worth to create an alternative graph type (with every graph being
> a full-fledged object)? However I do not quite understand your logic, maybe
> you are right after all and this is not necessary.

In practical applications where graphs might be useful:

1. There is no graph-wide operations or else they are impossibly 
inefficient.

2. Nodes are normally limited, updated in-place, never copied or moved.

3. Subgraphs are actively used without making copies of the whole graph.

4. Graph structure gets modified (e.g. rotation etc).

In short graphs are not containers, the picture you have in mind.

Consider graphs in the same league as doubly-linked lists.

-- 
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de