Re: Generalised approach to storing address details
From: Marshall <marshall.spight_at_gmail.com>
Date: 13 Dec 2006 19:20:16 -0800
Message-ID: <1166066416.283883.240010_at_l12g2000cwl.googlegroups.com>
Date: 13 Dec 2006 19:20:16 -0800
Message-ID: <1166066416.283883.240010_at_l12g2000cwl.googlegroups.com>
On Dec 13, 8:24 am, "Neo" <neo55..._at_hotmail.com> wrote:
> > ... di-graphs are my favorite model for presenting information and also for modeling stored data for software development
> ...What is a di-graph? Can you give a simple example of a di-graph? What
> software do you use to present and store di-graphs?
"Digraph" here is an abbreviation for "directed graph". That is, a graph in which the edges' two nodes are labeled "from" and "to."
http://en.wikipedia.org/wiki/Graph_%28mathematics%29#Directed_graph
Marshall Received on Thu Dec 14 2006 - 04:20:16 CET