Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
-
Economics & Finance
Data Structure Articles
Page 33 of 164
Count of simple cycles in an undirected graph having N vertices
Introduction Undirected graphs are an essential component of computer science and graph theory, representing a group of nodes connected by edges without any directionality. One common problem associated with undirected graphs is the counting of simple cycles or circuits, which are closed paths that visit each vertex only once. In this article, we will explore how to get total count of the given undirected graph with N vertices using the powerful programming languages C and C++. Undirected Graph Before we jump into coding, let's ensure everyone grasps what constitutes a simple cycle within an undirected graph. Let us consider an ...
Read MoreDSatur Algorithm for Graph Coloring
Introduction Graph coloring may be an essential issue in graph hypothesis. The DSatur algorithm presents a compelling approach to play down the utilization of colors while performing chart coloring. By deliberately selecting vertices with the most noteworthy immersion degree, DSatur guarantees an optimized color task that maximizes color differing qualities and minimizes color utilization. In this article, we explore the DSatur calculation for chart coloring and its utilization utilizing C++. The calculation decides its title from the two key concepts it utilizes: Degree and Submersion. It considers the degrees of the vertices and their inundation degrees, which speak to the ...
Read MoreLength of Longest increasing sequence of nodes in a given Graph
Introduction In graph hypothesis, the user will understand to find the length of the longest expanding grouping of nodes in a specified graph. It includes deciding the longest way in a chart where each hub within the way features a strictly increasing esteem compared to its past node. In this article, we are going investigate three approaches to unravel this issue utilizing C++. Each approach will be clarified in detail, counting the calculation, step-by-step execution, and yield. To guarantee consistency, we'll utilize the same input for all three approaches, and they will create the same yield. Approach 1: Depth-First Search ...
Read MoreLexicographically smallest string formed by replacing characters according to the given relation
Introduction The task of making the lexicographically smallest string by replacing characters according to a given relation poses a captivating challenge in string control. The objective is to modify the characters inside the input string, following to the required substitution rules, in arrange to get the littlest lexicographic order. In this article, we'll focus on solving this issue utilizing C++. We are going investigate three approaches to handle this issue, each utilizing a one of a kind technique and algorithmic method. These approaches are planned to supply distinctive bits of knowledge into understanding the issue, considering variables such as effectiveness, ...
Read MoreMinimum Jumps from Either End to Reach Largest and Smallest Character in given String
In this problem, we require to find the minimum jumps required to make to reach the largest and smallest character in the given string. We can move to the next or previous character in one jump. We can solve the problem by finding the position of the lexicographically largest and smallest character in the given string. After that, we can find the minimum jumps required to the found indexes from the left and right sides. Problem statement – We have a string str of length N containing the alphabetical characters in the uppercase. We need to find the minimum number ...
Read MoreFind if possible to visit every nodes in given Graph exactly once based on given conditions
Introduction Graph theory plays a crucial part in understanding a wide run of real-world issues, counting course optimization, organize examination, and task planning. One interesting issue inside graph theory is the seek for a Hamiltonian way, a way that visits each node in a graph exactly once. This issue has applications in zones such as circuit plan, DNA sequencing, and coordination’s arranging. In this article, we dig into the investigation of diverse approaches to decide on the off chance that it is conceivable to visit each hub in a given chart precisely once, based on certain conditions. We center on ...
Read MoreMinimum cost of path between given nodes containing at most K nodes in a directed and weighted graph
Introduction The issue of finding the minimum cost of a path between two given nodes in a directed and weighted graph, whereas ensuring that the path contains at most K nodes, may be a significant challenge in chart hypothesis. This issue has different applications in differing domains, counting transportation systems, logistics planning, and network optimization. In this article, we have investigated two distinctive approaches to handling this issue using C language. Each approach utilizes a special algorithmic procedure to discover the least cost path whereas considering the constraint on the number of nodes in the way. Approach 1: Dynamic Programming ...
Read MoreLength of Smallest Substring to be Replaced to make Frequency of each Character as N/3
In this problem, we need to find the smallest substring so that we can replace its character and make the frequency of each character equal to the N/3 in the given string. We can use the sliding window technique to solve the problem. We can find the minimum window size, which contains all excess characters, that will be the answer to the problem. Problem statement – We have given a string alpha. The size of the alpha is N which is always divisible by 3. The given task is to find the minimum length of the substring so that we ...
Read MoreMinimum number of moves to make M and N equal by repeatedly adding any divisor of number to itself except 1 and the number
Introduction The problem of finding the minimum number of moves to make two given numbers M and N rise by repeatedly including any divisor of a number (except 1 and the number itself) can be approached without utilizing Dynamic Programming. In this issue, we are required to plan methodologies that minimize the number of moves required to attain the specified uniformity. Two approaches are displayed to handle this issue: Greedy Algorithm, Prime Factorization. These approaches utilize distinctive strategies to recognize common divisors and optimize the method of making the numbers rise to investigate these non-Dynamic Programming approaches, we will pick up ...
Read MoreNumber of distinct Shortest Paths from Node 1 to N in a Weighted and Directed Graph
Introduction The issue at hand is to determine the number of distinct shortest ways from Node 1 to Node N in a weighted and directed graph. We are given a graph representation comprising of nodes and edges, where each edge encompasses a weight related with it. Our objective is to create an algorithm that can effectively calculate the count of particular shortest ways, taking into consideration the weighted nature of the graph. For this issue, we have presented three diverse approaches to decide the number of particular shortest ways. The primary approach utilizes a Depth-First Search (DFS) algorithm, the second ...
Read More