├── README.md
├── adjacency-list2.zip
├── adjacency-matrix--graph.zip
└── adjacency-matrix2.zip


/README.md:
--------------------------------------------------------------------------------
 1 | # Graph_Data_structures
 2 | 
 3 | A graph is a collection of nodes (vertices) connected by edges. In this repository, we provide an implementation of an undirected graph using adjacency lists.
 4 | 
 5 | Operations:
 6 | 
 7 | AddVertex: Adds a vertex to the graph.
 8 | 
 9 | AddEdge: Adds an edge between two vertices.
10 | 
11 | RemoveVertex: Removes a vertex from the graph.
12 | 
13 | RemoveEdge: Removes an edge between two vertices.
14 | 
15 | DFS (Depth-First Search): Traverses the graph using Depth-First Search algorithm.
16 | 
17 | BFS (Breadth-First Search): Traverses the graph using Breadth-First Search algorithm.
18 | 


--------------------------------------------------------------------------------
/adjacency-list2.zip:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/DharshiniB04/Graph_Data_structures/805a45b69520866493daad5bad60728c7a951fd1/adjacency-list2.zip


--------------------------------------------------------------------------------
/adjacency-matrix--graph.zip:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/DharshiniB04/Graph_Data_structures/805a45b69520866493daad5bad60728c7a951fd1/adjacency-matrix--graph.zip


--------------------------------------------------------------------------------
/adjacency-matrix2.zip:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/DharshiniB04/Graph_Data_structures/805a45b69520866493daad5bad60728c7a951fd1/adjacency-matrix2.zip


--------------------------------------------------------------------------------