Difference between revisions of "Graphs"
Mfrederick (talk | contribs) (→Comparison of List VS Matrix) |
Mfrederick (talk | contribs) (→Comparison of List VS Matrix) |
||
| Line 45: | Line 45: | ||
|- | |- | ||
| Less space, no wastage || Stores information about each edge | | Less space, no wastage || Stores information about each edge | ||
| − | |||
| − | |||
|} | |} | ||
Revision as of 13:14, 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.
Terms
weighted graph
vertex/node
edge/arc
undirected graph
directed graph
Adjacency Matrix
An adjacency matrix is a list showing the what vertexes are connected to their neighbors. This is represented by a list showing what vertex is connected to the other.
Adjacency List
This is a list shown in binary for the values that are going to be connected. It usually helps to transfer the matrices into a list first before you turn it into a graph to make things easier.
Comparison of List VS Matrix
| Matrix | List |
|---|---|
| Its quicker to find an edge | Needs to look at all items |
| Less space, no wastage | Stores information about each edge |
