chatGPT likes my metaphor:

“An analogy can be made between directed acyclic graphs (DAGs) and a frictionless liquid moving through pipes with check valves. DAGs are a type of graph where the edges have a direction and there are no cycles, meaning that there is a clear path from one node to another without loops. This can be compared to a liquid moving through pipes with check valves, where the liquid can only flow in one direction and there is no backflow.

On the other hand, undirected graphs can be analogized to frictionless liquid moving through pipes with no check valves. An undirected graph is a type of graph where edges have no direction and there are no loops. This can be compared to a liquid moving through pipes with no check valves, where the liquid can flow in any direction and there may be backflow.”

[responsivevoice_button voice="US English Male"]