by Graph data structures contains a set of vertices which is called as Node, together with a set of collection of pair of vertices which is called as an Edge.
A graph data structure can be represented as a pair (V, E) where V is a set of nodes called vertices and E is a collection of pairs of vertices called edges.
Graphs are used to solve many real life problems such as fastest ways to go from A to B etc.
Let’s have a look into some graphical examples of Graphs.
Graph properties
- It contains a set of vertices called as Nodes.
- It has a set of collection of pair of vertices which is called as an Edge.
Let’s have a look into some of the most popular and useful topics in Linked List.
- Graph basics and representation.
- Graph and its basic implementation.
- Depth first search for a Graph.
- Breadth first search for a Graph.
- Topological sort.
- Connected Graphs properties.
- Shortest path in unweighted Graph.
- Dijsktra Shortest Path Algorithm for Graph.
- Bellman’s Ford Shortest Path Algorithm for Graph.
