Re: OOP, this NG and you. Where is everyone?
- From: "johnzabroski@xxxxxxxxx" <johnzabroski@xxxxxxxxx>
- Date: Wed, 3 Dec 2008 20:52:09 -0800 (PST)
On Nov 24, 1:39 pm, topmind <topm...@xxxxxxxxxxxxxxxx> wrote:
Addendum to my reply:
I will agree that your approach is one possible way to represent sets
as graphs. But, its not the only way. My approach also works.
I think what you were trying to get at is that my approach requires a
unique name for the set while yours doesn't. For example, take two
unrelated sets: {A, B, C} and {D, E}.
In your approach, one could do this:
A-B-C
D-E
That's legitimate technique. But I chose a different approach where
all the nodes are referenced by a named set (where "member of" is
represented by a directed vertex). For computer usage and discussions,
it's best to name things. (In fact, there will be a unique name or
address at some point in the implementation process, so its something
that cannot be escaped.)
Your approach may reduce notation characters, but makes implementation
and discussions harder. We just had different goals. There is simply
more than one way to represent the same thing.
-T-
Mr. Bean's underpants?
.
- Prev by Date: Re: Database Model - Class, objects and interaction [LONG]
- Next by Date: Re: Database Model - Class, objects and interaction [LONG]
- Previous by thread: Re: Know any good OOA/D book
- Next by thread: Microsoft MVP Donald Belcham to Speak on Visual Studio, C# vNext, Aspect Oriented Programming, Live Mesh
- Index(es):
Relevant Pages
|
