Yeah, I'd be pretty wary of a dev who needed clarification on DAGs...
Agreed. Why would a person need to look it up when the name literally describes it. Directed? Means connections are in a single direction. Acyclic? A-cyclic = non-cyclical, doesn't have cycles. Graph is... well a graph.
Which part does the author think an average programmer should struggle with?
Yeah, I'd be pretty wary of a dev who needed clarification on DAGs...
Agreed. Why would a person need to look it up when the name literally describes it. Directed? Means connections are in a single direction. Acyclic? A-cyclic = non-cyclical, doesn't have cycles. Graph is... well a graph.
Which part does the author think an average programmer should struggle with?