- Trending Categories
Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Physics
Chemistry
Biology
Mathematics
English
Economics
Psychology
Social Studies
Fashion Studies
Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Found 34494 Articles for Programming
![Pranavnath](https://www.tutorialspoint.com/assets/profiles/629838/profile/60_1502721-1680003383.jpg)
121 Views
Introduction Graph homomorphism may be a crucial concept in chart hypothesis and computational science. Within the setting of C dialect, a chart homomorphism may be a mapping between two charts that jam the contiguousness connections between their vertices. It is frequently spoken to as a work that allocates vertices from one chart to vertices in another, whereas keeping up the edges between them. This concept empowers the consideration and examination of basic similitudes and associations between distinctive charts. By executing chart homomorphism in C, software engineers can investigate different applications, such as chart coordinating, chart coloring, and chart isomorphism testing, ... Read More
![Pranavnath](https://www.tutorialspoint.com/assets/profiles/629838/profile/60_1502721-1680003383.jpg)
64 Views
Introduction Graphs are powerful mathematical structures that allow us to model and visualize relationships between various entities. In computer science, graphs find application in a wide range of algorithms and data structures. One common problem with undirected graphs is determining whether a cycle exists between two given nodes. In this article, we embark upon the journey to unravel this mystery and present an elegant solution using C/C++. Determining cycles within an undirected graph is vital in various applications where connectivity matters. Undirected Graphs is determining whether a cycle exists between two given nodes Unweighted bidirectional (or undirected) graphs consist of ... Read More
![Pranavnath](https://www.tutorialspoint.com/assets/profiles/629838/profile/60_1502721-1680003383.jpg)
128 Views
Introduction Graph theory is a fundamental field in computer science, allowing us to study and visualize relationships between objects or entities. One important aspect of analyzing graphs understands the sizes of components or connected subgraphs within the network. In this article, we will explore how to construct a graph from component size for each node using C++ code. In graph theory, a component refers to any connected subgraph where there exists some path between any two vertices within that subgraph. It helps depict clusters or groups of interconnected nodes within the entire graph structure. A Graph from size of components ... Read More
![Pranavnath](https://www.tutorialspoint.com/assets/profiles/629838/profile/60_1502721-1680003383.jpg)
282 Views
Introduction Graph traversal could be a principal operation in computer science that includes going by all nodes of a graph. In certain scenarios, it may be fundamental to navigate the graph in the lexicographical order of nodes, which suggests going by the nodes in climbing numerical order. In this article, we'll investigate two distinctive approaches to performing a lexicographical DFS traversal of a graph utilizing the C language. These approaches point to creating the same correct yield while giving elective executions and viewpoints. They offer an establishment for understanding a wide extent of graph-related issues, empowering productive investigation, and analysis ... Read More
![Pranavnath](https://www.tutorialspoint.com/assets/profiles/629838/profile/60_1502721-1680003383.jpg)
69 Views
Introduction Finding the smallest set of vertices to visit all nodes in a graph could be a crucial issue in graph hypothesis. It has practical applications in different areas, counting network optimization, directing algorithms, and task planning. In this article, we are going investigate three diverse approaches to illuminate this problem: Depth-First Search (DFS), Breadth-First Search (BFS), and Depth-First Traversal with Backtracking. We are going give point by point clarifications, code usage within the C language, and algorithmic steps for each approach. Also, we'll illustrate the utilization of these approaches with a test graph to guarantee that all three strategies ... Read More
![Pranavnath](https://www.tutorialspoint.com/assets/profiles/629838/profile/60_1502721-1680003383.jpg)
68 Views
Introduction The number of ways to reach the beginning hub after traveling through precisely K edges in a total chart can be calculated utilizing different approaches within the C dialect. One approach is to utilize brute constrain recursion, where we investigate all conceivable ways. Another approach includes energetic programming, where we store and reuse halfway comes about to dodge excess computations. Moreover, a numerical equation exists to specifically compute the number of ways based on the number of hubs and edges. These strategies give effective arrangements to decide the check of ways driving back to the beginning hub in a ... Read More
![Pranavnath](https://www.tutorialspoint.com/assets/profiles/629838/profile/60_1502721-1680003383.jpg)
37 Views
Introduction Finding the primary undeleted integer from a given extend in a detached graph after performing multiple queries may be a challenging issue in graph theory. In this article, we investigate the errand of distinguishing the primary undeleted numbers and give two approaches to fathom it utilizing C++. Each approach offers a diverse point of view and utilizes distinctive calculations and data structures. The problem includes developing a graph, checking certain nodes as deleted, and after that deciding the primary undeleted numbers inside an indicated extend. The graph represents associations between nodes, and the deleted nodes are those that have ... Read More
![Prabhdeep Singh](https://www.tutorialspoint.com/assets/profiles/546958/profile/60_1428686-1667456005.jpg)
463 Views
Round robins scheduling is used in CPU scheduling, we are given some M number of servers and N number of requests. Each request has some arrival time and processing time. We have to find the load on each server using the Round-Robin Scheduling for which we are going to implement a program in C++ programming language using the priority queue and sets. Example Let's understand the problem with the help of an input-output example − Input int arrival_time[] = { 1, 2, 4, 6 }; int process_time[] = { 6, 1, 2, 2 }; int servers = 2; Output ... Read More
![Prabhdeep Singh](https://www.tutorialspoint.com/assets/profiles/546958/profile/60_1428686-1667456005.jpg)
37 Views
A linked list is a linear data structure that consists of nodes and each node is not present in the contiguous form in the main memory, instead, each node contains the address of the next node. We are given a linked list of even length, we have to create a new linked list that contains half number of nodes as the given node, and the value of each node contains the difference between the square of the nodes of the given linked list in decreasing order. Example Let's understand the problem with the help of an input-output example − ... Read More
![Prabhdeep Singh](https://www.tutorialspoint.com/assets/profiles/546958/profile/60_1428686-1667456005.jpg)
183 Views
A queue is a linear data structure that works on the FIFO property where each element is added to the queue from the rear and the elements are extracted from the front and use the principle of first in first out. In the list, we can access every element while in the queue we can only access the first element. In this tutorial, we are going to see two methods of how to convert a queue into the list. Creating a Queue in Python Queue in a linear data structure which works on the first in first out property and ... Read More