About 4,350,000 results
Open links in new tab
  1. How do I check if a directed graph is acyclic? - Stack Overflow

    Feb 24, 2009 · How do I check if a directed graph is acyclic? And how is the algorithm called? I would appreciate a reference.

  2. Can someone explain in simple terms to me what a directed acyclic …

    Feb 17, 2010 · Can someone explain in simple terms to me what a directed acyclic graph is? I have looked on Wikipedia but it doesn't really make me see its use in programming.

  3. Confusion about the definition of an acyclic graph

    Dec 23, 2019 · A graph is acyclic if it does not contain a cycle. With that said, a directed graph is one where the edges are all endowed with a direction. Associated with every digraph is its underlying …

  4. What is cyclic and acyclic communication? - Stack Overflow

    Aug 3, 2013 · This is what I would consider cyclic communication, something that is always updating a certain type of information that can be sent as data. So I might be completely wrong with this …

  5. What's the difference between the data structure Tree and Graph?

    Sep 14, 2011 · A Tree is just a restricted form of a Graph. Trees have direction (parent / child relationships) and don't contain cycles. They fit with in the category of Directed Acyclic Graphs (or a …

  6. Acyclic vs Exact - Mathematics Stack Exchange

    Jan 7, 2012 · A complex is acyclic if and only if it is exact. (see for instance Exercise 1.1.5 in Weibel's Homological Algebra book, or probably anyplace where this is defined). An object is acyclic for a …

  7. How do you correctly reason that this directed graph is acyclic?

    May 25, 2018 · How can you correctly reason that this directed graph is acyclic? I can only visually say that this graph is acyclic because there is not a single path in the graph where the starting vertex is …

  8. Show that a connected graph on $n$ vertices is a tree if and only if it ...

    An interesting corollary of this statement is that for a connected graph $G = (V,E)$ on $n$ vertices, a forest $E’ \subseteq E$ is a spanning tree of $G$ if and ...

  9. How DAG works under the covers in RDD? - Stack Overflow

    However, the material to uncover the internal mechanics on Resilient Distributed Datasets with Directed Acyclic Graph seems lacking in this paper. Should it be better learned by investigating the source code?

  10. Newest 'directed-acyclic-graphs' Questions - Stack Overflow

    Dec 15, 2025 · Is there a name for the process of creating a DAG based on underlying data and code dependencies? I am taking over a monorepo of data processing programs that are run iteratively in …