Graph on Data Structure

Topics: Graph theory, Glossary of graph theory, Graph Pages: 9 (2152 words) Published: January 7, 2013
tructureResearch on Graphs in Data Structure
Source: Introduction to graphs
Graphs are widely-used structure in computer science and different computer applications. We don't say data structurehere and see the difference. Graphs mean to store and analyze metadata, the connections, which present in data. For instance, consider cities in your country. Road network, which connects them, can be represented as a graph and then analyzed. We can examine, if one city can be reached from another one or find the shortest route between two cities. First of all, we introduce some definitions on graphs. Next, we are going to show, how graphs are represented inside of a computer. Then you can turn to basic graph algorithms. There are two important sets of objects, which specify graph and its structure. First set is V, which is called vertex-set. In the example with road network cities are vertices. Each vertex can be drawn as a circle with vertex's number inside. |  |

vertices|  |
Next important set is E, which is called edge-set. E is a subset of V x V. Simply speaking, each edge connects two vertices, including a case, when a vertex is connected to itself (such an edge is called a loop). All graphs are divided into two big groups: directed and undirected graphs. The difference is that edges in directed graphs, called arcs, have a direction. These kinds of graphs have much in common with each other, but significant differences are also present. We will accentuate which kind of graphs is considered in the particular algorithm description. Edge can be drawn as a line. If a graph is directed, each line has an arrow. | |

undirected graph| directed graph|
Now, we present some basic graph definitions.
* Sequence of vertices, such that there is an edge from each vertex to the next in sequence, is called path. First vertex in the path is called the start vertex; the last vertex in the path is called the end vertex. If start and end vertices are the same, path is called cycle. Path is called simple, if it includes every vertex only once. Cycle is called simple, if it includes every vertex, except start (end) one, only once. Let's see examples of path and cycle. | |

path (simple)| cycle (simple)|
The last definition we give here is a weighted graph. Graph is called weighted, if every edge is associated with a real number, called edge weight. For instance, in the road network example, weight of each road may be its length or minimal time needed to drive along. |  |

weighted graph| |
Undirected graphs representation
There are several possible ways to represent a graph inside the computer. We will discuss two of them: adjacency matrixand adjacency list. Adjacency matrix
Each cell aij of an adjacency matrix contains 0, if there is an edge between i-th and j-th vertices, and 1 otherwise. Before discussing the advantages and disadvantages of this kind of representation, let us see an example. | |

Graph| Adjacency matrix|

| |
Edge (2, 5)| Cells for the edge (2, 5)|

| |
Edge (1, 3)| Cells for the edge (1, 3)|
The graph presented by example is undirected. It means that its adjacency matrix is symmetric. Indeed, in undirected graph, if there is an edge (2, 5) then there is also an edge (5, 2). This is also the reason, why there are two cells for every edge in the sample. Loops, if they are allowed in a graph, correspond to the diagonal elements of an adjacency matrix. Advantages. Adjacency matrix is very convenient to work with. Add (remove) an edge can be done in O(1) time, the same time is required to check, if there is an edge between two vertices. Also it is very simple to program and in all our graph tutorials we are going to work with this kind of representation. Disadvantages.

* Adjacency matrix consumes huge amount of memory for storing big graphs. All graphs can be divided into two...
Continue Reading

Please join StudyMode to read the full document

You May Also Find These Documents Helpful

  • Graphs Data Structures Essay
  • Essay on Graphs In Data Structure
  • Essay on Course Outline Data Structures
  • Data Structures Essay
  • Data structures Essay
  • Essay on data structures
  • Data Structure Essay
  • Essay on Data Structure

Become a StudyMode Member

Sign Up - It's Free