Hello All,
I have an assignment if anybody can help me.
I have different Id's and each ID is associated with any node of a directed acyclic graph stored in data base.
I am supposed to search those nodes associated with these ID’s (I can find because I have method for that.) and after that I am supposed to find all children and parents of those nodes and finally on bases of those children and parents I am supposed to make another DAG in the memory.
Problem is this that How can I traverse the given DAG to find the children and parent of any Node?
Secondly how can I make a new DAG by using those children and parents?

Thanks

Talha Sajjad

Hi talhas,

do u googled

check
http://www.cs.mcgill.ca/~cs251/OldCourses/1997/topic30/
it has an applet source code also

do your assignment your self
post any specific doubts in the path

best wishes..

jomet.
---------------------------------------------
Once you start a working on something,
dont be afraid of failure and dont abandon it.
People who work sincerely are the happiest.