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
Articles by Ayush Singh
Page 15 of 17
Program to Print all the Non-Reachable Nodes | Using BFS
Non−reachable nodes are nodes in a chart that cannot be reached from a particular source hub. They are hubs that don't have any way of interfacing with the source hub inside the given chart. The recognisable proof of non−reachable hubs makes a difference in determining the detached or disconnected substances inside the chart. Calculations like breadth−first look (BFS) or depth−first look (DFS) can be utilised to navigate the chart and effectively stamp the gone−by hubs, subsequently encouraging the distinguishing proof of non−reachable hubs. Analysing and understanding non−reachable hubs is important in evaluating organised networks, recognising crevices in data or networks, ...
Read MoreProduct of Minimum Edge Weight Between all Pairs of a Tree
The product of the least edge weight between all sets of a tree is gotten by finding the least weight edge for each conceivable match of vertices within the tree and, after that, increasing all these least weights together. This esteem speaks to the smallest conceivable toll or weight required to navigate the tree from any vertex to any other vertex. By considering the least weight of each edge, we guarantee that we find the most proficient way between any two vertices within the tree. The item of these least edge weights gives a compact degree of the general network ...
Read MorePrint the Path Between any Two Nodes of a Tree | DFS
To print the way between any two hubs of a tree utilising Depth−First Look (DFS), we will navigate the tree and keep track of the way from the source hub to the target hub. DFS investigates the tree by going as deep as conceivable and recently backtracking. We begin DFS at the source hub and recursively visit its children. During navigation, we keep a way variable that stores the current way from the source to the current hub. In the event that we encounter the target hub amid the traversal, we print the way. This approach permits us to find ...
Read MoreWhy Prim’s and Kruskal’s MST algorithm fails for Directed Graph?
Prim's method and Kruskal's algorithm are two common approaches for locating MSTs in undirected graphs. However, these techniques cannot generate correct MSTs for directed graphs. This is due to the fact that directed graphs are not well−suited to the underlying assumptions and methods used by Prim's and Kruskal's algorithms. Prim’s Algorithm First, there's Prim's Algorithm, which involves adding edges to an expanding MST in a greedy fashion until all vertices are covered. A vertex inside the MST is linked to a vertex outside the MST through the edge with the lowest weight. Since all edges in an undirected graph can ...
Read MoreWelsh Powell Graph Colouring Algorithm
A key concern in information technology, graph colouring has numerous applications in fields including scheduling, register assignment, and map colouring. An effective method for colouring graphs that makes sure nearby vertices have various shades while using fewer colours is the Welsh Powell algorithm. In this post, we'll examine 2 ways to use C++ algorithms to create the Welsh Powell algorithm. Methods Used Sequential Vertex Ordering Largest First Vertex Ordering Sequential Vertex Ordering In the first technique, colours are successively assigned to the vertices after they are arranged in decreasing order according to their degrees. This technique makes sure ...
Read MoreShortest Path with Exactly k Edges in a Directed and Weighted Graph
In a coordinated and weighted chart, the issue of finding the most brief way with precisely k edges includes deciding the way that has the least weight while navigating precisely k edges. This will be accomplished by employing dynamic programming strategies, such as employing a 3D framework to store the least weight of all conceivable ways. The calculation repeats over the vertices and edges, overhauling the least weight at each step. By considering all conceivable ways with precisely k edges, the calculation distinguishes the most limited way with k edges within the chart. Methods Used Naive Recursive approach Dijkstra's ...
Read MoreMaximize the Number of Uncolored Vertices Appearing Along the Path from Root Vertex and the Colored Vertices
Go through the entire graph and compute the difference between the depth of each vertex and the number of vertices in its subtree to maximise the number of uncolored vertices that occur along the path from the root vertex to the coloured vertex. Find the uncolored vertex that has the greatest influence on the route by choosing the 'k' largest deviations. The sum of these parallaxes gives the maximum number of uncolored vertices. This method allows us to aggressively optimise the number of colourless vertices that occur, improving overall results and emphasising the importance of colourless vertices on the way ...
Read MoreFind the Minimum Spanning Tree with Alternating Colored Edges
The code executes a calculation to discover the least crossing tree by substituting coloured edges. It employs an energetic programming approach to calculate the least expensive toll. The calculation considers all conceivable edges and colours and recursively assesses the cost of counting or barring each edge based on whether it keeps up the substituting colour design. It keeps track of the least severe toll experienced so far by employing the memoization method. The calculation develops the least crossing tree by eagerly selecting edges with the least toll, guaranteeing that adjoining edges have distinctive colours. At last, it returns the least−fetched ...
Read MoreFind if a Degree Sequence can form a Simple Graph | Havel-Hakimi Algorithm
A degree chain in graph theory indicates the order of vertices' degrees. It is crucial to ascertain whether a degree order can result in a simple graph, or a graph without parallel or self−looping edges. We will examine three approaches to resolving this issue in this blog, concentrating on the Havel−Hakimi algorithm. We'll go over the algorithm used by each technique, offer related code representations with the appropriate headers, and show off each approach's unique results. Methods Used Havel−Hakimi Algorithm Sort & check Direct Count Havel− Hakimi Algorithm The Havel−Hakimi algorithm is a popular technique for figuring out ...
Read MoreFind Count of Pair of Nodes at Even Distance
To discover the tally of sets of hubs at an indeed remove in a chart, we will utilise the chart traversal calculation. Beginning from each hub, we perform a traversal, such as a breadth−first look (BFS) or a depth−first look (DFS), and keep track of the separations of all hubs from the beginning hub. While navigating, we tally the number of hubs at indeed separations experienced. By repeating this handle for all hubs, we get the entire check of sets of hubs at separations within the chart. This approach permits us to productively decide the number of sets of hubs ...
Read More