Algorithms On Graphs

From Adam Colton
Revision as of 02:37, 8 June 2016 by Adamcolton (talk | contribs) (Created page with ";Graph: A graph is a set of vertices and a set of edges, each of which connects two vertices. ;Loop: An edge that connects a vertex to itself ;Simple Graph: A graph with no lo...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search
Graph
A graph is a set of vertices and a set of edges, each of which connects two vertices.
Loop
An edge that connects a vertex to itself
Simple Graph
A graph with no loops and no more than one connection between any set of vertices.
Retrieved from "https://wiki.adamcolton.net/index.php?title=Algorithms_On_Graphs&oldid=5789"