From: Tom Cloyd <tomcloyd@...>
Date: 2008-12-23T09:58:12+09:00
Subject: Re: Name that data structure!

Addendum:

This model encompasses directed graphs, and non-directed ones too (are 
those call "marked" graphs? am not familiar with that term).

E.g.

.n apple .r is a .n fruit <= a directed relationship; as specified it 
only goes one way.
.n fruit .r contains .n apple <= another directed relationship.
.n apple .r is a / contains .n fruit <= a way of building a 
bi-relational relationship. Starting at either end of the relationship, 
you "read" the component of the relation specified which you first 
encounter, up to the "/"

t.