Ford-Fulkerson Algorithm for Maximum Flow Problem
Python Algorithm - Ford-Fulkerson Algorithm for Maximum Flow Problem - Given a graph which represents a flow network where...
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.
2834 Articles
Cpp Algorithm – Introduction to Stack
C++ Algorithm -Introduction to Stack - Data Structure - Stack is a linear data structure which follows a particular order in...
Python Algorithm – Introduction to Stack
Python Algorithm -Introduction to Stack - Data Structure -Stack is a linear data structure which follows a particular order...
C Algorithm – Introduction to Stack
C Algorithm -Introduction to Stack - Data Structure -Stack is a linear data structure which follows a particular order in...
How to turn off a particular bit in a number
C++ program How to turn off a particular bit in a number-Bit Algorithm-Given a number n and a value k, turn of the k’th bit...
C Programming – Ugly Numbers
C Programming - Ugly Numbers - Dynamic Programming Ugly numbers are numbers whose only prime factors are 2, 3 or 5. Every...
C++ Programming – Ugly Numbers
C++ Programming - Ugly Numbers - Dynamic Programming Ugly numbers are numbers whose only prime factors are 2, 3 or 5. Every...
Java Programming – Ugly Numbers
Java Programming - Ugly Numbers - Dynamic Programming Ugly numbers are numbers whose only prime factors are 2, 3 or 5. Here...
Python Programming – Ugly Numbers
Python Programming - Ugly Numbers - Dynamic Programming Ugly numbers are numbers whose only prime factors are 2, 3 or 5.
Shortest Path-Some interesting shortest path questions
Shortest Path Some interesting shortest path questions The shortest path may change. The reason is, there may be different...
