The Gateway to Computer Science Excellence
0 votes
149 views
algorithm to find more than one path between any two vertices of a graph G=(V,E) , with a complexity of O(VE) ?
in Graph Theory by Boss | 149 views
+1
it means to finding loop,

it is not directed path.rt?
0
@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.  :)

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
52,218 questions
59,890 answers
201,085 comments
118,128 users