Re: [Roll] [roll] #5: DODAG

[Philip Levis <pal at cs.stanford.edu>]

On Nov 9, 2009, at 2:11 AM, Julien Abeille (jabeille) wrote:

> Hi Tim,
>
> My question is: are there DAGs that are not DODAGs in RPL? My  
> feeling is
> no. Hence I would suppress the DODAG instead of turning all "DAG" into
> "DODAG".
> Best,
> Julien

I disagree -- Directed Acyclic Graph is a very well defined term in  
graph theory. We shouldn't redefine it. A DODAG is a particular kind  
of DAG, where there is one and only one node which has only incoming  
edges. We could maybe come up with a better term than DODAG, but DAG  
definitely isn't it. It will confuse readers tremendously.

Phil