A named algorithm operating on a graph of nodes and edges, computing a property of the graph such as connectivity, shortest paths or flow. Belongs here: Edmonds-Karp Algorithm, Johnson's Algorithm, Kosaraju's Algorithm and Tarjan's Strongly Connected Components Algorithm, each defined in terms of graph structure. Does not belong here: an algorithm that happens to be describable with a graph-like diagram but is not itself defined over a graph's nodes and edges, and the general concept of a graph itself, filed under the model-holding concept type rather than here.
Facts
Comparison
Era of Emergence Browse By
Sources
1. Wikipedia: Graph theory
WikipediaGraph theory, History section, term-origin sentenceQuote, Graph theory, History section, term-origin sentence
The term "graph" was introduced by James Joseph Sylvester in a paper published in 1878 in Nature, where he drew an analogy between "quantic invariants" and "co-variants" of algebra and molecular diagrams.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.