C++ Algorithm – Maximum Bipartite Matching – Graph Algorithm – A matching in a Bipartite Graph is a set of the edges chosen in such a way
C++ programming
94 Articles
94
Given a dictionary, and two words ‘start’ and ‘target’ (both of same length). Find length of the smallest chain from ‘start’ to ‘target’ if it exists.
Given an unsigned integer, swap all odd bits with even bits. For example, if the given number is 23 (00010111), it should be converted to 43 (00101011).
A Simple Solution use Max-Flow based s-t cut algorithm to find minimum cut. Consider every pair of vertices as source ‘s’ and sink ‘t’.
C++ Programming – Program for Fibonacci numbers – Dynamic Programming The Fibonacci numbers are the numbers in the following integer sequence.
C++ programming Articulation Points (or Cut Vertices) in a Graph – Articulation points represent vulnerabilities in a connected network
C++ Programming – Word Wrap Problem – Dynamic Programming Given a sequence of words, and a limit on the number of characters that can be put in one line
C++ Algorithm – Find maximum number of edge disjoint paths between two vertices – Graph Algorithm – Given a directed graph and two vertices in it, source
C++ Programming – Partition Problem – Dynamic Programming Partition problem is to determine whether a given set can be partitioned into two subsets
C++ Algorithm – Ford-Fulkerson Algorithm for Maximum Flow Problem – Graph Algorithm – Given a graph which represents a flow network where every edge