Definitions of graph, Data Structure & Algorithms

Assignment Help:

A graph G might be defined as a finite set V of vertices & a set E of edges (pair of connected vertices). The notation utilized is as follows:

Graph G = (V, E)

Consider the graph of Figure

For the graph , the set of vertices is V = {1, 2, 3, 4, 5}.

For the graph ,the set of edges is E = {(1,2), (1,5), (1,3), (5,4), (4,3), (2,3) }.

The elements of E are always a pair of elements.

468_DEFINITIONS of graph.png

Figure: A graph

It might be noted that unlike nodes of a tree, graph contain a very restricted relationship among the nodes (vertices). There is no direct relationship among the vertices 1 & 4 although they are connected through 3.

Directed graph & Undirected graph: If in a graph every edge (a,b) is marked through a direction from a to b, then we call it a Directed graph (digraph). Conversely, if directions are not marked onto the edges, then the graph is called an Undirected graph.

In a Directed graph, the edges (1,5) & (5,1) represent two distinct edges while in an Undirected graph, (1,5) & (5,1) represent the similar edge. Graphs are utilized in several types of modeling. For instance, graphs can be utilized to represent connecting roads among cities.


Related Discussions:- Definitions of graph

Deletion of a node from an avl tree, For AVL trees the deletion algorithm i...

For AVL trees the deletion algorithm is a little more complicated as there are various extra steps involved in the deletion of node. If the node is not a leaf node, then it contain

Consistent heuristic function - graph search, Consistent Heuristic Function...

Consistent Heuristic Function - Graph Search Recall the notions of consistency and admissibility for an A* search heuristic. a. Consider a graph with four nodes S, A, B, C,

Process of channel access, Channel access In first generation systems, ...

Channel access In first generation systems, every cell supports a number of channels. At any given time a channel is allocated to only one user. Second generation systems also

Travelling salesman problem, Example 3: Travelling Salesman problem G...

Example 3: Travelling Salesman problem Given: n associated cities and distances among them Find: tour of minimum length that visits all of city. Solutions: How several

Delete a given specific node from a doubly linked list. , D elete a specif...

D elete a specific Node from Double Linked List as follows DELETEDBL(INFO, FORW, BACK, START, AVAIL,LOC) 1. [Delete Node] Set FORW [ BACK [LOC]]:= FORW[LOC]& BACK [FORW[

Sparse matrices, SPARSE MATRICES Matrices along with good number of zer...

SPARSE MATRICES Matrices along with good number of zero entries are called sparse matrices. Refer the following matrices of Figure (a)

Trees, Have you ever thought about the handling of our files in operating s...

Have you ever thought about the handling of our files in operating system? Why do we contain a hierarchical file system? How do files saved & deleted under hierarchical directories

General Tree, How to create an General Tree and how to search general tree?...

How to create an General Tree and how to search general tree?

Process of decision making under uncertainty, (a) Describe the steps involv...

(a) Describe the steps involved in the process of decision making under uncertainty. (b) Explain the following principles of decision making: (i) Laplace, (ii) Hurwicz. (c

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd