Re: Canonical DB
From: Robert Martin <unclebob_at_objectmentor.com>
Date: Thu, 22 Jun 2006 22:48:26 -0500
Message-ID: <2006062222482677923-unclebob_at_objectmentorcom>
>
> No, tree searches and graph walks are things
> you *need* to do (and specify) when all you have
> is navigational structures. They are part of their cost.
Date: Thu, 22 Jun 2006 22:48:26 -0500
Message-ID: <2006062222482677923-unclebob_at_objectmentorcom>
On 2006-06-21 18:47:03 -0500, mAsterdam <mAsterdam_at_vrijdag.org> said:
>> mAsterdam said: >>> >>> And I asked "Which (or which types of) >>> computations are easier [with a >>> navigational structure]?" >> >> Things like tree searches, graph walks, etc.
>
> No, tree searches and graph walks are things
> you *need* to do (and specify) when all you have
> is navigational structures. They are part of their cost.
Uh... So in RM there just *aren't* graphs or trees?
>
> Now where is the benefit - what are you computing:
> Which (or which types of) computations are easier
> with a navigational structure?
The cheapest path between two nodes through a network graph?
-- Robert C. Martin (Uncle Bob) | email: unclebob_at_objectmentor.com Object Mentor Inc. | blog: www.butunclebob.com The Agile Transition Experts | web: www.objectmentor.com 800-338-6716 |Received on Fri Jun 23 2006 - 05:48:26 CEST