Difference between revisions of "Graphs"
Mfrederick (talk | contribs) (→What is a graph) |
Mfrederick (talk | contribs) (→What is a graph) |
||
| Line 6: | Line 6: | ||
The degree of a vertex is how many things are connected to it, in the picture, there would be 2. | The degree of a vertex is how many things are connected to it, in the picture, there would be 2. | ||
| + | |||
| + | Edges can also be called connectors and vertex can also be called nodes or entries. | ||
==Terms== | ==Terms== | ||
Revision as of 12:45, 26 November 2017
Contents
What is a graph
A graph is an abstract data structure. It can be used to solve routine problems.
Vertices connected by an edge (see picture) are called Neighbours.
The degree of a vertex is how many things are connected to it, in the picture, there would be 2.
Edges can also be called connectors and vertex can also be called nodes or entries.
