MCPcopy Create free account
hub / github.com/Ainevsia/Leetcode-Rust / frogPosition

Method frogPosition

Weekly Contest 179/p4/Solution.cpp:45–56  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

43 }
44
45 double frogPosition(int n, vector<vector<int>>& edges, int t, int target) {
46 visited.resize(n+1, false);
47 ut.resize(n+1);
48 this->target = target;
49 for (vector<int> edge : edges) {
50 int from = edge[0], to = edge[1];
51 ut[from].push_back(to);
52 ut[to].push_back(from);
53 }
54 dfs(1, 1, t);
55 return p;
56 }
57};
58
59int main() {

Callers

nothing calls this directly

Calls

no outgoing calls

Tested by

no test coverage detected