Algorithm

Even though they look different, all types of graphs can be represented in a similar way. There’re generally two types of Graph Representation: Adjacency Matrix Adjacency List Adjacency List Adjacency List consists of Linked Lists. Each vertex is considered an array index, and each element represents a linked list. These linked lists contain the vertices…

What is a Graph in Data Structure? A graph is a non-linear data structure that consists of vertices and edges, where vertices contain the information or data, and the edges work as a link between pair of vertices. It is used to solve real word problems like finding the best route to the destination location…

What is Topological Sort Algorithm? Topological Sorting is also known as Kahn’s algorithm and is a popular Sorting Algorithm. Using a directed graph as input, Topological Sort sorts the nodes so that each appears before the one it points to. This algorithm is applied on a DAG (Directed Acyclic Graph) so that each node appears…

What is a Prime Factorization? The Prime factor of a given any number is the factor that is a prime number. Factors when multiplied give you another number. A prime number is divisible by itself or 1 . In other words, prime factors are determined by finding which prime numbers multiply together to form the…

What is a Singly Linked List? Singly Linked List is a linear and unidirectional data structure, where data is saved on the nodes, and each node is connected via a link to its next node. Each node contains a data field and a link to the next node. Singly Linked Lists can be traversed in…

What is a doubly linked list? In a doubly linked list, each node has links to both the previous and next node. Each node consists of three elements: one holds the data, and another two are the next and the previous node’s pointers. These two pointers help us to go forward or backward from a…

What is the Radix Sort Algorithm? Radix Sort is a non-comparative sorting algorithm. It works by grouping the individual digits of the elements to be sorted. A stable sorting technique is then used to organize the elements based on their radix. It is a linear sorting algorithm. The sorting process involves the following properties: Finding…

What is the largest sum contiguous subarray? A subarray is a continuous part of an array. It can be a single element of an array or some fraction of the array. The largest sum contiguous subarray means a subarray that has the maximum sum value. For example, an array is {-10, 5, 1, 6, -9,…

What is the shortest path or shortest distance? A path from the source vertex to the destination vertex that costs a minimum is the shortest path or shortest distance. In graph theory, it is possible to have multiple routes from a source to a destination. Between these routes, if there is a route that costs…