A graph is a data structure that consists of the following two components:
- A finite set of vertices also called as nodes.
- A finite set of ordered pair of the form (u, v) called as edge. The pair is ordered because (u, v) is not same as (v, u) in case of a directed graph(di-graph). The pair of the form (u, v) indicates that there is an edge from vertex u to vertex v. The edges may contain weight/value/cost.
A graph can be implemented using an adjacency list or an adjacency matrix.
- Number of Islands | Medium | Solution | Problem Description
- Clone Graph | Medium | Solution | Problem Description
- Max Area of Island | Medium | Solution | Problem Description
- Pacific Atlantic Water Flow | Medium | Solution | Problem Description
- Surrounded Regions | Medium | Solution | Problem Description
- Rotten Oranges | Medium | Solution | Problem Description
- Walls and Gates | Medium | Solution | Problem Description
- Course Schedule | Medium | Solution | Problem Description
- Course Schedule II | Medium | Solution | Problem Description
- Redundant Connection | Medium | Solution | Problem Description
- Number of Connected Components in an Undirected Graph | Medium | Solution | Problem Description
- Graph Valid Tree | Medium | Solution | Problem Description
- Word Ladder | Hard | Solution | Problem Description
Category: Graphs
Status: In Progress
Author: David Bujosa