A graph which is acyclic contains no closed paths. Typical stream networks are formally described as AcyclicNetworks, even if they are braided or have distributaries.