MCPcopy Create free account
hub / github.com/neetcode-gh/leetcode / bfs

Function bfs

javascript/0133-clone-graph.js:52–62  ·  view source on GitHub ↗
(queue, seen)

Source from the content-addressed store, hash-verified

50};
51
52const bfs = (queue, seen) => {
53 while (!queue.isEmpty()) {
54 /* Time O(V + E) */
55 for (let i = queue.size() - 1; 0 <= i; i--) {
56 /* Time O(W) */
57 const node = queue.dequeue();
58
59 cloneNeighbors(node, seen, queue); /* Space O(N) */
60 }
61 }
62};
63
64const cloneNeighbors = (node, seen, queue) => {
65 for (const neighbor of node.neighbors) {

Callers 1

cloneGraphFunction · 0.70

Calls 3

cloneNeighborsFunction · 0.85
isEmptyMethod · 0.45
sizeMethod · 0.45

Tested by

no test coverage detected