–tags: Data Structures
Graphs:
- Siblings and parent nodes have restriction in trees so graph removes it
- No starting node or root node
- Transport or Network points can be explained using graphs
- Vertices and edges: Sets of vertices and edges
- Directed or undirected graph ; also weighted graph to give weight to the edges ; also can be used for priority
- Linked list, Tress , Heaps are specific graphs with some sorts of constraints