![]() | This article is rated B-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
|
is there proof that the algorithm which is provided here does not fall into local optima? just because its greedy does not means it returns a globally optimal solution...
I grasp that one of the primary people to whom this is of interest are mathematicians, and I've got enough of a math background that I'm sure I could get an understanding of this, but there are lots of people to whom Cyclomatic Complexity (which maps to this page) is of interest who are not themselves mathematically oriented and don't want to spend a lot of time developing an understanding of otherwise limited-use deep mathematical jargon to get a handle on this concept... namely, computer people. This article could use a much more jargon-limited summary, perhaps with some simple examples pertaining to computational usage and a few graphics showing basic examples.
If that's objectionable, then the article should be forked into this one and one titled "cyclomatic complexity" which is designed to be read by non-mathematicians. I am willing to bet that the basic elements of this notion could be gotten across without 15 side forays into specialist terminology just to have an essential feel for what the term means.
--
216.52.207.72 (
talk)
21:48, 14 July 2015 (UTC)
In fragment For a connected planar graph with m edges and n edges n must be nodes, not edges, Jumpow ( talk) 16:24, 3 August 2016 (UTC)
The term "circuit rank" is not common in graph theory, as far as I have seen in years of reading. A more common name is "cycle rank". The names "cyclomatic number" and "nullity" have also been used often enough. I would place those names in the first sentence. (Was this article written by a computer scientist? They have their own terminology for graph theory.) Zaslav ( talk) 08:30, 22 August 2016 (UTC)
The article states:
Is this an original observation of the contributor? If so, could the author please explain further? Is this substantiated by other published research? Please provide citations if so. Atester ( talk) 18:17, 11 June 2019 (UTC)
Isn't this simply the Euler characteristic? 5.28.186.92 ( talk) 15:03, 24 November 2022 (UTC)
![]() | This article is rated B-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
|
is there proof that the algorithm which is provided here does not fall into local optima? just because its greedy does not means it returns a globally optimal solution...
I grasp that one of the primary people to whom this is of interest are mathematicians, and I've got enough of a math background that I'm sure I could get an understanding of this, but there are lots of people to whom Cyclomatic Complexity (which maps to this page) is of interest who are not themselves mathematically oriented and don't want to spend a lot of time developing an understanding of otherwise limited-use deep mathematical jargon to get a handle on this concept... namely, computer people. This article could use a much more jargon-limited summary, perhaps with some simple examples pertaining to computational usage and a few graphics showing basic examples.
If that's objectionable, then the article should be forked into this one and one titled "cyclomatic complexity" which is designed to be read by non-mathematicians. I am willing to bet that the basic elements of this notion could be gotten across without 15 side forays into specialist terminology just to have an essential feel for what the term means.
--
216.52.207.72 (
talk)
21:48, 14 July 2015 (UTC)
In fragment For a connected planar graph with m edges and n edges n must be nodes, not edges, Jumpow ( talk) 16:24, 3 August 2016 (UTC)
The term "circuit rank" is not common in graph theory, as far as I have seen in years of reading. A more common name is "cycle rank". The names "cyclomatic number" and "nullity" have also been used often enough. I would place those names in the first sentence. (Was this article written by a computer scientist? They have their own terminology for graph theory.) Zaslav ( talk) 08:30, 22 August 2016 (UTC)
The article states:
Is this an original observation of the contributor? If so, could the author please explain further? Is this substantiated by other published research? Please provide citations if so. Atester ( talk) 18:17, 11 June 2019 (UTC)
Isn't this simply the Euler characteristic? 5.28.186.92 ( talk) 15:03, 24 November 2022 (UTC)