The C library function isgraph() checks whether a character is a graphic character or not.
Characters that have graphical representation are known are graphic charac...

Share

Given a word, find lexicographically greater permutation of it. For example, lexicographically next permutation of “gfg” is “ggf” and next...

Share

C++ STL offer many utilities to solve basic common life problems. Comparing values are always necessary, but sometimes we need to compare the strings also. Therefore,...

Share

Given a directed graph, find out whether the graph is strongly connected or not. A directed graph is strongly connected if there is a path between any two pair of ve...

Share

An undirected graph is called Biconnected if there are two vertex-disjoint paths between any two vertices. In a Biconnected Graph, there is a simple cycle through an...

Share

Given a Weighted Directed Acyclic Graph (DAG) and a source vertex s in it, find the longest distances from s to all other vertices in the given graph.
The longest pa...

Share

Graph coloring problem is to assign colors to certain elements of a graph subject to certain constraints.
Vertex coloring is the most common graph coloring problem. ...

Share

We introduced graph coloring and applications in previous post. As discussed in the previous post, graph coloring is widely used. Unfortunately, there is no efficient...

Share

<p> tag
The <p> tag in HTML defines a paragraph. These have both opening and closing tag. So anything mentioned within <p> and </p> is treate...

Share

Counting the number of characters is important because almost all the text boxes that rely on user input have certain limit on the number of characters that can be in...

Share