Given a directed graph G, with V vertices and E edges. Each edge in E is associated with a real number ‘r’,a reliabilty factor with r between 0(exclusive) and 1(inclusive). You are also given a pair of nodes u and v. Find the most reliable path in the given graph from u to v. Input will be the graph represented as a matrix with the following format: * the number of vertices n. (therefore, A is an nxn matrix) * The elements of A, row-wise: (total n*n numbers) A(i,j) = 0 denotes that the edge (i,j) is not present A(i,j) between 0 (exclusive) and 1 (inclusive) indicates that the edge (i,j) is present with reliability A(i,j). Output: Your output will be a sequence of vertices giving the path from u to v such as 1,4,3,5,8,6,7 with u=1 and v=7. The output is thus a comma separated list of vertices giving the path from u to v.
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.