Computer scienceAlgorithms and Data StructuresData structuresGraphsGraph types

Directed acyclic graph

Additional properties of DAGs

Report a typo

There are other properties of DAGs that were not mentioned in this topic. Think a little and select the correct ones.

For each vertex we can consider its incoming and outgoing edges. Note, that a directed edge $e = (u, v)$ is an outgoing edge with respect to $u$ and an incoming edge with respect to $v$ .

Select one or more options from the list

There is a vertex that has no outgoing edges.

Each vertex has at least one outgoing edge.

There is a vertex that has no incoming edges.

Each vertex has at least one incoming edge.

___

Create a free account to access the full topic