![]() | This page is an archive of past discussions. Do not edit the contents of this page. If you wish to start a new discussion or revive an old one, please do so on the current talk page. |
I can not find the term "bicycle" explained in the graph theory glossary.
Directed they are, but acyclic they are not ;-) Gabriel Wicke 09:02, 4 November 2005 (UTC)
"for any vertex v", I believe should be "for all verticies", because if any of the verticies are part of a cycle then the graph is not a DAG.
Should we note that finding the longest path in a weighted graph is NP-hard, except for DAGs?
I think a depth-first search algorithm should mark nodes that are visited in order not to visit them again in DAGS as well. The algorithm will terminate in finite time, yes, but it can get out of hand real fast. Mauritsmaartendejong 17:50, 15 July 2007 (UTC)
Is Weisstein's conjecture referenced in any peer-reviewed journal, or just on the web pages of Eric Weisstein? Isn't that a bit too much credit - even in bold letters —Preceding
unsigned comment added by
71.217.7.79 (
talk)
08:13, 9 March 2008 (UTC)
There is a series detailing development/implementation of a directed acyclic word graph, with open source code, at this site (dotnetperls.com). I don't know if it is Wikipedia-quality, but it ranks on Google searches, and offers code. There are 7 articles in the series.
I suggest to add a mention to the application of DAG's in versioning systems as in Git, Bitkeeper, Mercurial. Mariostorti ( talk) 14:14, 8 June 2008 (UTC)
In the Properties section, it says "A DAG can be expanded to a forest of rooted trees using this simple algorithm [...]". Could anyone give a reference for a proof of that claim? —Preceding unsigned comment added by 150.214.239.21 ( talk) 11:30, 9 February 2009 (UTC)
i have come to this page a few times over the years to find out what one of these things is. However, the description is so high-level that i have never been able to actually understand what this thing is. So can i suggest a section on this page that starts from the groud-up and explains what this is. Please.
Imagine you wanted to explain this to a 12 year old and go from there. —Preceding unsigned comment added by 86.136.56.47 ( talk • contribs)
I wondered if it would be appropriate to give an example of the use of DAGs in epidemiology. There is quite some literature on the subject. If no one more expert in this field has a go at this, perhaps I'll be bold and attempt to add a section. Is it reasonable to add a section of how these are applied in a specific field in this way? Any thoughts? Jimjamjak ( talk) 00:26, 15 November 2011 (UTC)
The section titled "Partial orders and topological ordering" currently says that "Each directed acyclic graph gives rise to a partial order \leq". However, to be more exact, DAGs represet _strict_ partial orders. So, the \leq notation should be "<" and "partial order" should be replaced with "strict partial order" in that section. I'm not sure if this is too pedantic or not, but at least a mention of the strictness condition on the partial order would help here. — Preceding unsigned comment added by 2607:4000:200:13:C81B:819A:C731:A9AC ( talk) 19:02, 8 October 2012 (UTC)
It should be mentioned that multiple inheritance in class structure of OO languages like C++ also forms directed acyclic graph. Mclaudt ( talk) 22:37, 15 March 2013 (UTC)
But how do you implement a DAG or even a G (Graph)? - neither article describes how or even provides a pointer as far as I can tell. 98.169.58.20 ( talk) 19:50, 15 April 2014 (UTC)The Arcadian
![]() | This page is an archive of past discussions. Do not edit the contents of this page. If you wish to start a new discussion or revive an old one, please do so on the current talk page. |
I can not find the term "bicycle" explained in the graph theory glossary.
Directed they are, but acyclic they are not ;-) Gabriel Wicke 09:02, 4 November 2005 (UTC)
"for any vertex v", I believe should be "for all verticies", because if any of the verticies are part of a cycle then the graph is not a DAG.
Should we note that finding the longest path in a weighted graph is NP-hard, except for DAGs?
I think a depth-first search algorithm should mark nodes that are visited in order not to visit them again in DAGS as well. The algorithm will terminate in finite time, yes, but it can get out of hand real fast. Mauritsmaartendejong 17:50, 15 July 2007 (UTC)
Is Weisstein's conjecture referenced in any peer-reviewed journal, or just on the web pages of Eric Weisstein? Isn't that a bit too much credit - even in bold letters —Preceding
unsigned comment added by
71.217.7.79 (
talk)
08:13, 9 March 2008 (UTC)
There is a series detailing development/implementation of a directed acyclic word graph, with open source code, at this site (dotnetperls.com). I don't know if it is Wikipedia-quality, but it ranks on Google searches, and offers code. There are 7 articles in the series.
I suggest to add a mention to the application of DAG's in versioning systems as in Git, Bitkeeper, Mercurial. Mariostorti ( talk) 14:14, 8 June 2008 (UTC)
In the Properties section, it says "A DAG can be expanded to a forest of rooted trees using this simple algorithm [...]". Could anyone give a reference for a proof of that claim? —Preceding unsigned comment added by 150.214.239.21 ( talk) 11:30, 9 February 2009 (UTC)
i have come to this page a few times over the years to find out what one of these things is. However, the description is so high-level that i have never been able to actually understand what this thing is. So can i suggest a section on this page that starts from the groud-up and explains what this is. Please.
Imagine you wanted to explain this to a 12 year old and go from there. —Preceding unsigned comment added by 86.136.56.47 ( talk • contribs)
I wondered if it would be appropriate to give an example of the use of DAGs in epidemiology. There is quite some literature on the subject. If no one more expert in this field has a go at this, perhaps I'll be bold and attempt to add a section. Is it reasonable to add a section of how these are applied in a specific field in this way? Any thoughts? Jimjamjak ( talk) 00:26, 15 November 2011 (UTC)
The section titled "Partial orders and topological ordering" currently says that "Each directed acyclic graph gives rise to a partial order \leq". However, to be more exact, DAGs represet _strict_ partial orders. So, the \leq notation should be "<" and "partial order" should be replaced with "strict partial order" in that section. I'm not sure if this is too pedantic or not, but at least a mention of the strictness condition on the partial order would help here. — Preceding unsigned comment added by 2607:4000:200:13:C81B:819A:C731:A9AC ( talk) 19:02, 8 October 2012 (UTC)
It should be mentioned that multiple inheritance in class structure of OO languages like C++ also forms directed acyclic graph. Mclaudt ( talk) 22:37, 15 March 2013 (UTC)
But how do you implement a DAG or even a G (Graph)? - neither article describes how or even provides a pointer as far as I can tell. 98.169.58.20 ( talk) 19:50, 15 April 2014 (UTC)The Arcadian