Summary
Data Structure Name | Graph |
Type | Linear Data Structure |
Tagline | |
Use cases | |
Types | Directed Graph Undirected Graph |
Implementations | ![]() ![]() ![]() ![]() ![]() |
Definition
Graph data structure contains nodes/vertices, which are connected by arcs/edges.
![Graph Overview](https://bigboxcode.com/wp-content/uploads/2024/06/Graph-Overview-1024x967.png)
Types
Graphs can be of the following types-
Use Cases
When we have a long data list, and we don’t need random access to an element, then we should use a linked list.
NOTE
Characteristics
Elements
A Graph data structure has the following info-
- Vertice(node)
- Arc(edge)
NOTES
Functionality
Code Implementations
Use the following links to check Graph data structure implementation in specific programming languages.