MCPcopy Create free account
hub / github.com/Vishruth-S/CompetitiveCode / bridge

Method bridge

HackerEarth_problems/Edges on a path/solution.py:49–58  ·  view source on GitHub ↗
(self)

Source from the content-addressed store, hash-verified

47
48 #function to call helper function with initial inputs
49 def bridge(self):
50
51 visited = [False] * (self.V)
52 disc = [float("Inf")] * (self.V)
53 low = [float("Inf")] * (self.V)
54 parent = [-1] * (self.V)
55
56 for i in range(self.V):
57 if visited[i] == False:
58 self.bridgeUtil(i,visited,parent,low,disc)
59
60 #path function returns parent array
61 #this function uses dfs for finding the path

Callers 1

solution.pyFile · 0.80

Calls 1

bridgeUtilMethod · 0.95

Tested by

no test coverage detected