This is a C++ program to implement Treap. Treap data structure is basically a randomized binary search tree. Here, we shall consider insert, delete and search operations on this.Functions and descriptionsfunction rotLeft() for left rotationFirst rotate the tree then set new root.function rotRight() for right rotationFirst rotate the tree then ... Read More
Vizing’s theorem state that the chromatic index of simple graph can be either maxdegree or maxdegree+1. Here, chromatic index means maximum color needed for the edge coloring of the graph.This is a C++ program to implement the Vizing’s Theorem.AlgorithmBegin Take the number of vertices and edges as input. ... Read More
You cannot use EXCEPT in MySQL, instead use the NOT IN operator. Let us first create a table −mysql> create table DemoTable ( Number1 int ); Query OK, 0 rows affected (0.71 sec)Insert some records in the table using insert command −mysql> insert into DemoTable values(100); Query ... Read More
This is a C++ Program to Demonstrate the Implementation of 4-Color Problem.AlgorithmBegin Develop function issafe() to check if the current color assignment is safe for vertex v i.e. checks whether the edge exists or not. If it exists, then next check whether the color ... Read More
This is a C++ program to solve the Dominating Set problem.AlgorithmBegin Take the number of vertices and edges as input. Also take the edge point of the edges. function dominant(): Declare vector Set. Take any edge e graph connecting the vertices i.e.; ... Read More
This is a C++ program to find whether a path exists between 2 given nodesAlgorithmBegin function isReach() is a recursive function to check whether d is reachable to s: A) Mark all the vertices as unvisited. B) Mark the current node as visited and enqueue it and ... Read More
This is a C++ program to generate all pairs of subsets, whose union make the Set.AlgorithmsBegin function UnionSet(): Arguments: a[] = an array. n = number of elements. Body of the function: 1) Generate binary code ... Read More
This is a C++ Program to solve a matching problem for a Given Specific Case. Here, N men and N women are given, each person has ranked all members of the opposite gender in order of preference, marry the men and women together such that there are no two people ... Read More
This is a C++ program to generate all possible combinations out of a, b, c, d, e.AlgorithmsBegin Take the number of elements and the elements as input. function Combi(char a[], int reqLen, int s, int currLen, bool check[], int l) to print the all possible combination of ... Read More
This is a C++ program to generate all possible subsets with exactly k elements in each subset.AlgorithmsBegin function PossibleSubSet(char a[], int reqLen, int s, int currLen, bool check[], int l): If currLen > reqLen Return Else if currLen = reqLen Then print the ... Read More
This C++ program displays the solution to the Tower of Hanoi problem using binary value.There is one binary digit for each disk.The most significant bit represents the largest disk. A value of 0 indicates that the largest disk is on the initial peg, while a 1 indicates that it’s on ... Read More
This is a C++ program to generate a Random Subset by Coin Flipping.AlgorithmsBegin Take elements in an array as input. Using rand(), generate a random binary sequence. It generates randomly 0 or 1 as coin flipping and print the array element if it is 1. EndExample#include<iostream> #include<stdlib.h> ... Read More
This is a C++ program to perform integer partition for a specific case. In this program, a positive integer n is given, and shall have to generate all possible unique ways to represent n as sum of positive integers.AlgorithmBegin function displayAllUniqueParts(int m): 1) Set Index of last element ... Read More
This is a C++ program to implement the Binary Counting Method to generate subsets of a set.AlgorithmsBegin Take the array elements as input. function BinaryCounting(): Calculate subset by r = pow(2, n) // here n = number of elements. Generate binary numbers ... Read More
