An abstraction for problem-solving
In mathematics, graphs are a way to formally represent a network, basically a collection of connected objects. We call the objects nodes or vertices. The connections are called edges or arcs.
Graph is a super useful abstraction for problem-solving in Computer Science.
We will look at this abstraction from the lens of Data Structures and Algorithms.
Resources
- Applications of Graph Theory In Computer Science: An Overview, S.G.Shirinivas et. al.