Be the first to like this
A simple algorithm I devised to enumerate the disjoint paths between a pair of vertices in a given graph. This algorithm was devised as a part of my course-work for Masters [Tech.] at IIT-Banaras Hindu University.
Clipping is a handy way to collect important slides you want to go back to later.