31. The method of claim 30 , wherein said updating step includes performing any of a forward and backward search of said DAG.
30. The method of claim 29 , further comprising converting said dependency network to a directed acyclic graph (DAG) in order to eliminate loops in said network.