Applications of Depth First Search
Applications of Depth First Search - Graph Algorithms - Depth-first search (DFS) is an algorithm (or technique) for...
Author
Venkatesan Prabu
Wikitechy Founder, Author, International Speaker, and Job Consultant. My role as the CEO of Wikitechy, I help businesses build their next generation digital platforms and help with their product innovation and growth strategy. I'm a frequent speaker at tech conferences and events.
2835 Articles
Optimization Techniques | Set 1 (Modulus)
Optimization Techniques | Set 1 (Modulus) - Bit Algorithm - The modulus operator (%) in various languages is costly...
Convex Hull | Set 1 (Jarvis’s Algorithm or Wrapping)
Convex Hull | Set 1 (Jarvis’s Algorithm or Wrapping) - Geometric Algorithms - The idea of Jarvis’s Algorithm is simple, we...
Python Algorithm – Depth First Traversal or DFS for a Graph
Python Algorithm - Depth First Traversal or DFS for a Graph - Graph Algorithms - Depth First Traversal for a graph is...
Cpp Algorithm – Depth First Traversal or DFS for a Graph
Cpp Algorithm - Depth First Traversal or DFS for a Graph - Graph Algorithms -Depth First Traversal for a graph is similar to...
Next higher number with same number of set bits
Next higher number with same number of set bits - Bit Algorithm - When we observe the binary sequence from 0 to 2n – 1 (n is...
Java Algorithm – Depth First Traversal or DFS for a Graph
Java Algorithm - Depth First Traversal or DFS for a Graph -Graph Algorithms -Depth First Traversal for a graph is similar to...
Program to count number of set bits in an (big) array
Program to count number of set bits in an (big) array- Bit Algorithm - The simple approach would be, create an efficient...
How to check if a given point lies inside or outside a polygon?
How to check if a given point lies inside or outside a polygon - Geometric Algorithm - To handle this, after checking if...
A Boolean Array Puzzle
A Boolean Array Puzzle - Bit Algorithm - Following are the specifications to follow. It is guaranteed that one element is 0...
