A quick introduction to 10 basic graph algorithms with examples and visualisations. Graphs have become a powerful means of modelling and capturing data in real-world scenarios such as social media networks, web pages and links, and locations and routes in GPS. If you have a set of objects that are related to each other, then you can represent them using a graph. In this article, I will be briefly explaining 10 basic graph algorithms that become very useful for analysis and their applications.

A **graph** consists of a finite set of **vertices** or nodes and a set of **edges** connecting these vertices. Two vertices are said to be **adjacent** if they are connected to each other by the same edge.

Some basic definitions related to graphs are given below. You can refer to Figure 1 for examples.

- *
*Order: **The number of vertices in the graph - *
*Size: **The number of edges in the graph **Vertex degree:**The number of edges that are incident to a vertex**Isolated vertex:**A vertex that is not connected to any other vertices in the graph**Self-loop**: An edge from a vertex to itself**Directed graph:**A graph where all the edges have a direction indicating what is the start vertex and what is the end vertex**Undirected graph:**A graph with edges that have no direction**Weighted graph:**Edges of the graph has weights**Unweighted graph:**Edges of the graph has no weights

Fig 1. Visualization of Terminology of Graphs (Image by Author)

Fig 2. Animation of BFS traversal of a graph (Image by Author)

*Traversing* or *searching* is one of the fundamental operations which can be performed on graphs. In ** breadth-first search** (BFS), we start at a particular vertex and explore all of its neighbours at the present depth before moving on to the vertices in the next level. Unlike trees, graphs can contain cycles (a path where the first and last vertices are the same). Hence, we have to keep track of the visited vertices. When implementing BFS, we use a queue data structure.

Figure 2 denotes the animation of a BFS traversal of an example graph. Note how vertices are discovered (yellow) and get visited (red).

- Used to determine the shortest paths and minimum spanning trees.
- Used by search engine crawlers to build indexes of web pages.
- Used to search on social networks.
- Used to find available neighbour nodes in peer-to-peer networks such as BitTorrent.

computer-science data-structures data-science algorithms graph

Online Data Science Training in Noida at CETPA, best institute in India for Data Science Online Course and Certification. Call now at 9911417779 to avail 50% discount.

Data Science and Analytics market evolves to adapt to the constantly changing economic and business environments. Our latest survey report suggests that as the overall Data Science and Analytics market evolves to adapt to the constantly changing economic and business environments, data scientists and AI practitioners should be aware of the skills and tools that the broader community is working on. A good grip in these skills will further help data science enthusiasts to get the best jobs that various industries in their data science functions are offering.

The agenda of the talk included an introduction to 3D data, its applications and case studies, 3D data alignment and more.

I won’t go into detail about graph data structure, but I will summarise must-to-know graph algorithms to solve coding interview questions.

🔵 Intellipaat Data Science with Python course: https://intellipaat.com/python-for-data-science-training/In this Data Science With Python Training video, you...