Don't miss

## Graph(Data Structure)

By on 02:53

Graph is a collection of ordered pair of sets including vertex and edges(V,E).Graph is a non-linear data structure and provide many to many(M:M) relationship.We used different-2 operation to finding the path of nodes and shortest path of nodes like Depth First Search(DFS),Breath First Search(BST) and Dijkstra's Algorithm,Kruskal's Algorithm respectively.Graph used in c,c++,java,c# etc.

Example of Graph:-

Type of Graph or Application or Theory of Graph:-

1)Undirected Graph:-Undirected Graph are those graph whose edges are undirected to each other(no direction).

2)Directed Graph:-Directed Graph are those graph whose edges are directed(has a direction).

3)Mixed Graph:-Mixed Graph are those Graph in which some edges are directed and some are not.

4)Simple Graph:-Simple Graph are those graph which has no parallel(//) edges.

5)Multi-Graph:-Multi-Graph are those graph which either // edges or self edges.

6)Isolated Graph:-Isolated Graph are those graph whose degree of vertex is zero or 0.

7)Connected Graph:-Connected Graph are those graph whose all vertex are connected to each other.

8)Disconnected Graph:-Disconnected Graph are those graph whose all vertex are not connects each other nodes.

9)Weakly Connected Graph(Di Graph):-Di Graph are those graph whose nodes are traverse to reach any node.

10)Strongly Connected Graph:-Strongly Connected Graph are those graph whose nodes are not traverse to reach any node.

11)Null Graph:-Null Graph are those graph which contains only isolated vertex.

12)Planner Graph:-Planner Graph are those graph which has no cross edge.

13)Tree(Graph):-Tree is also called as graph which has n-1 edges.

14)Isomorphic Graph:-Isomorphic Graph are those graph which has same number of vertex,edges and degree but its structure are different.