(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. (1994-12-07)

In addition suitable contents:
[ 2 ] [ = ] [ ai ] [ am ] [ an ] [ ar ] [ arc ] [ at ] [ B ] [ b ] [ ba ] [ ch ] [ ck ] [ cl ] [ co ] [ con ] [ cy ] [ cycle ] [ D ] [ DAG ] [ de ] [ directed graph ] [ du ] [ ec ] [ ed ] [ er ] [ es ] [ fi ] [ file ] [ fr ] [ G ] [ gr ] [ graph ] [ h ] [ hat ] [ hr ] [ id ] [ il ] [ in ] [ ir ] [ is ] [ Lex ] [ mo ] [ mod ] [ module ] [ na ] [ ng ] [ ni ] [ no ] [ node ] [ ns ] [ om ] [ ph ] [ query ] [ rc ] [ re ] [ ro ] [ route ] [ se ] [ T ] [ th ] [ to ]