40
I’ve promised myself never to use gradle (www.andreinc.net)
submitted 3 years ago by to c/programming@programming.dev
24 comments fedilink hide all child comments
you are viewing a single comment's thread
view the rest of the comments
[–] 26 points 3 years ago* (12 children)

Serious question: Is “Directed Acyclical Graph” really an unknown term for people? The author harped on it pretty hard, but what it is…is pretty apparent, no? I mean, I’ve encountered the term often, but I don’t think I had any need to look it up…

  • permalink
  • fedilink
  • source
  • hideshow 12 child comments
    •
  • [–] 14 points 3 years ago (2 children)

    I'm a computer engineer with more than a decade of development experience with embedded systems... I use C/C++/python everyday and "Directed Acyclical Graph" is never mentioned by name, no one in my experience says make me a DAG. Hell, I had to look it up when I read your comment and went "oh that's what those are called". I use em to show relationships between states or to descide a system that is best diagramed using a DAG. Do I or anyone I've talked to in my career call them DAG.. lol no.

  • permalink
  • fedilink
  • source
  • parent
  • hideshow 2 child comments
    •
  • [–] 5 points 3 years ago (2 children)

    It's very well-known and common knowledge. It's certainly something that I will talk about without feeling the need to define terms or something. I would assume anyone unfamiliar with it either didn't pay attention in school or never went to school to begin with.

  • permalink
  • fedilink
  • source
  • parent
  • hideshow 2 child comments
    •
  • [–] 1 point 3 years ago (1 child)

    I'm guessing I didn't know what it is by name because I never went for a compsci degree so you're probably right

  • permalink
  • fedilink
  • source
  • parent
  • hideshow 1 child comment
    •
  • [–] 2 points 3 years ago

    It's never too late to learn about them. They're super common in practice so it's very helpful to know about them. A lot of things are a DAG, like tree data structures and dependency graphs. Having no cycles in a directed graph has a lot of nice properties too, like allowing one to use efficient graph traversal algorithms, topological sorting, or its transitive closure. It's come up multiple times in my career so it's definitely worth knowing imo.

  • permalink
  • fedilink
  • source
  • parent
  • [–] 4 points 3 years ago (3 children)

    Yeah, I'd be pretty wary of a dev who needed clarification on DAGs...

  • permalink
  • fedilink
  • source
  • parent
  • hideshow 3 child comments
    •
  • [+] [S] 5 points 3 years ago* (last edited 3 years ago) (1 child)
    [deleted]
  • permalink
  • fedilink
  • source
  • parent
  • hideshow 1 child comment
    •
  • [–] 6 points 3 years ago

    They probably know what it is, but it's a bad point if they're trying to paint DAGs as esoteric CS stuff for the average programmer. I needed to use a topological sort for work coding 2 weeks ago, and any time you're using a build system, even as simple as Make, you're using DAGs. Acting like it's a tough concept makes me wonder why I should accept the rest of the argument.

    Can't say I have a strong feeling about Gradle though 🤷‍♀️

  • permalink
  • fedilink
  • source
  • parent
  • [–] 4 points 3 years ago

    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?

  • permalink
  • fedilink
  • source
  • parent
  • [–] 1 point 3 years ago

    Programmer/devops here. Without looking it up, I don't know what a DAG is. However, I'm guessing if I saw one, I'd recognize it.

    ...looked it up...

    Immediately a dependency chart comes to mind

  • permalink
  • fedilink
  • source
  • parent