Graph

 graph is non linear ds. it consisting of vertices and edges.

it denote by G(V,E) 

types

null graph ( graph have no edges)

trival graph ( have only one vertex)

undirected graph

directed graph

connected graph

disconnected graph

regular graph

complete graph(there is an edge to each other node)

cycle graph

cyclic graph(graph have at least one cycle ) 

directed Acyclic graph(directed graph not contain any cycle)

bipartite graph

weighted graph

 

Representation of graph ds

 => adjacency matrix

=> adjacency list