(DAG) A directed graph containing no cycles. This means that if there is a route from node A to node B then there is no way back.
Last updated: 1994-12-07
Updated: Mon Feb 27 13:45:32 2017
No longer supported by Imperial
College Department of Computing
Copyright Denis Howe 1985