0 votes 0 votes algorithm to find more than one path between any two vertices of a graph G=(V,E) , with a complexity of O(VE) ? Graph Theory graph-theory discrete-mathematics graph-connectivity engineering-mathematics + – Pavan Kumar Munnam asked May 12, 2017 Pavan Kumar Munnam 391 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply srestha commented May 12, 2017 reply Follow Share it means to finding loop, it is not directed path.rt? 1 votes 1 votes Devshree Dubey commented May 12, 2017 reply Follow Share @Srestha, not just a matter of directed path but see for Non-Directed Path from V->E and if possibly Self Loops on V and E as well if it isn't a simple graph. :) 0 votes 0 votes Please log in or register to add a comment.
