Master Graphs Data Structure
#day1
INTRODUCTION:
1. A Graph is a Non-Linear Data Structures
2. It is basically a collection of nodes/vertices and edges
3. The Graph is denoted by G(E, V)
4. A Graph can be Directed, Un-directed, Weighted and, Un-weighted
4. In Directed Graph, (u, v) != (v, u)
5. In an Un-directed Graph, (u, v) == (v, u)
6. In a Weighted Graph, edges may contain weight/value/cost
7. In an Un-weighted Graph, we can assume weight/value/cost on edges equals to 1