Re: MI ammunition : linked lists

[Georg Bauhaus <sb463ba@l1-hrz.uni-duisburg.de>]

Marius Amado Alves <amado.alves@netcabo.pt> wrote:
: On Tue, 2003-11-11 at 18:38, Georg Bauhaus wrote:
:> amado.alves <amado.alves@netcabo.pt> wrote:
:> : <<Inheritance should reflect an "is a" relationship. Do you fill comfortable stating that a middle node is a first node and a last
:> : node at the same time?...>>
:> : 
:> : I do saying a Node_Pointing_Both_Ways is a Node_Pointing_Forward and a Node_Pointing_Backward.
:> : 
:> : But I agree with the general advice. Thanks.
:> 
:> Maybe there is another clear picture, if you think of slightly
:> more complex structure than a list. You can "ask" a node, "do
:> you have a predecessor/successor?", but what question are you
:> going to ask a graph node?
:> For example, if a star is a node with indegree >= 5, does it
:> make sense to employ any kind of ihneritance to reflect an
:> indegree of 5?
: 
: The main question to be a asked a graph node is "what nodes are attached
: to you?" The reply is a iterator over the corresponding nodes.
: 
: (Note another reply in this thread made the same claim for MI for linked
: lists regarding names with different names than mine but with the same
: exact meaning.)

Hm, interesting, so the structural relation between nodes in a graph is
provided by an iterator pointing to 0 or more of the neigbours in some
order. That could be applied to lists as well... 

Still the reply is an iterator
pointing_to_this_neighbour, and then also
pointing_to_the_next_neighbour, and then also
..., and finally
???

O.K., I'll stop insiting and iterating.


Georg