(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
Better Than TripAdvisor
- Holiday destination reviews, hotel information,
pictures, sightseeing advice and food reviews.
Updated: Tue Jul 26 09:57:23 2016
No longer supported by Imperial College Department of Computing
Copyright Denis Howe 1985