[kplato] Functional Breakdown
Jim Sabatke
kplato@kde.org
Mon, 18 Jun 2001 18:51:22 -0500
Yup. IMHO, we need to implemnt both the tree and digraph (map)
functionality in order for the project to be of any use. I'm wondering
if we shouldn't implement a bare-bones tree and digraph functionality
before adding anything else. We could move forward in easy stages.
Jim
Chris Clarke wrote:
>On Monday 18 June 2001 14:11, Jim Sabatke wrote:
>
>>I agree with the analysis that a task class should be created to
>>encapsulate the calculations. The class should be based on a "general
>>tree" type of classs.
>>
>
>This is something where we have to be careful not to get into implementation
>details too quickly. When you look at it from the WBS structure the task
>list is a tree. When you look at it from the dependency point of view the
>task list is a map.
>
>Which way we want to represent it internally (or if we do both!) depends on
>the way we're going to access it most often, and performance concerns around
>that.
>
>Chris.
>
--
Jim Sabatke
SuSE 7.1 Linux
Kernel - 2.4.0
http://www.execpc.com/~jsabatke
"People tell me that I'm fading fast, that I can't last the whole night through" Janis Ian