2 Dec 2019

  • December 02, 2019
  • Amitraj
Graph Data Structure

-> Graph is an abstract data type.


-> A Graph is a non-linear data structure, is a collection of nodes and edges. The nodes are sometimes also referred to as vertices and the edges are lines  that connect any two nodes in the graph.

-> A Graph consists of a finite set of vertices(or nodes) and set of Edges which connect a pair of nodes.

-> It is used in social networks like Facebook, LinkedIn etc.



In the graph,

V = {0, 1, 2, 3}
E = {(0,1), (0,2), (0,3), (1,2)}
G = {V, E}




Related Posts:

  • Doubly Linked List Data Structure  Doubly Linked List Data Structure -> Doubly Linked List is a variation of Linked list in which navigation is possible in both ways, either forward and backward easily as compared to Single Linked List.  -&g… Read More
  • Singly Linked List Data Structure Singly Linked List Data Structure -> Singly linked lists contain nodes which have a data part as well as an address part i.e. next, which points to the next node in the sequence of nodes. -> Operations that can be p… Read More
  • infix to post fix (Reverse polish notation) expression Infix Expression It follows the scheme of <operand><operator><operand> i.e. an <operator> is preceded and succeeded by an <operand>. Such an expression is termed infix expression. E… Read More
  • Implementation of Queue Data Structure Implementation of Queue Data Structure * Queue :- Queue is a linear data structure in which elements are inserted from one end and deleted from another end.                   &… Read More
  • Difference between Array and Linked List Difference between Array and Linked List -> Both Linked List and Array are used to store linear data of similar type, but an array consumes contiguous memory locations allocated at compile time, i.e. at the time of decl… Read More

Translate

Popular Posts