cse 373 graph traversal
play

CSE 373: Graph traversal Michael Lee Friday, Feb 16, 2018 1 - PowerPoint PPT Presentation

Jun 03, 2023 •24 likes •1.55k views

CSE 373: Graph traversal Michael Lee Friday, Feb 16, 2018 1 Warmup Warmup Given a graph, assign each node one of two colors such that no two adjacent vertices have the same color. (If its impossible to color the graph this way, your

  1. Breadth-fjrst search (BFS) queue E . V E , which simplifjes to V So, So we check each edge at most twice For each node, check each edge to see if we should add to Breadth-fjrst traversal, core idea: We visit each node once. 4. Runtime: 3. Use a set to store nodes we don’t want to recheck/revisit 2. Add and remove nodes from queue until it’s empty visit 1. Use something (e.g. a queue) to keep track of every vertex to 5

  2. Breadth-fjrst search (BFS) queue E . V E , which simplifjes to V So, So we check each edge at most twice For each node, check each edge to see if we should add to Breadth-fjrst traversal, core idea: We visit each node once. 4. Runtime: 3. Use a set to store nodes we don’t want to recheck/revisit 2. Add and remove nodes from queue until it’s empty visit 1. Use something (e.g. a queue) to keep track of every vertex to 5

  3. Breadth-fjrst search (BFS) queue E . V E , which simplifjes to V So, So we check each edge at most twice For each node, check each edge to see if we should add to Breadth-fjrst traversal, core idea: We visit each node once. 4. Runtime: 3. Use a set to store nodes we don’t want to recheck/revisit 2. Add and remove nodes from queue until it’s empty visit 1. Use something (e.g. a queue) to keep track of every vertex to 5

  4. Breadth-fjrst search (BFS) queue E . V E , which simplifjes to V So, So we check each edge at most twice For each node, check each edge to see if we should add to Breadth-fjrst traversal, core idea: 4. Runtime: 3. Use a set to store nodes we don’t want to recheck/revisit 2. Add and remove nodes from queue until it’s empty visit 1. Use something (e.g. a queue) to keep track of every vertex to 5 ◮ We visit each node once.

  5. Breadth-fjrst search (BFS) queue E . V E , which simplifjes to V So, So we check each edge at most twice 5 Breadth-fjrst traversal, core idea: 4. Runtime: 3. Use a set to store nodes we don’t want to recheck/revisit 2. Add and remove nodes from queue until it’s empty visit 1. Use something (e.g. a queue) to keep track of every vertex to ◮ We visit each node once. ◮ For each node, check each edge to see if we should add to

  6. Breadth-fjrst search (BFS) queue E . V E , which simplifjes to V So, 5 Breadth-fjrst traversal, core idea: 4. Runtime: 3. Use a set to store nodes we don’t want to recheck/revisit 2. Add and remove nodes from queue until it’s empty visit 1. Use something (e.g. a queue) to keep track of every vertex to ◮ We visit each node once. ◮ For each node, check each edge to see if we should add to ◮ So we check each edge at most twice

  7. Breadth-fjrst search (BFS) Breadth-fjrst traversal, core idea: 1. Use something (e.g. a queue) to keep track of every vertex to visit 2. Add and remove nodes from queue until it’s empty 3. Use a set to store nodes we don’t want to recheck/revisit 4. Runtime: queue 5 ◮ We visit each node once. ◮ For each node, check each edge to see if we should add to ◮ So we check each edge at most twice So, O ( | V | + 2 | E | ) , which simplifjes to O ( | V | + | E | ) .

  8. Breadth-fjrst search (BFS) Pseudocode: 6 search(v): visited = empty set queue.enqueue(v) visited.add(v) while (queue is not empty): curr = queue.dequeue() for (w : v.neighbors()): if (w not in visited): queue.enqueue(w) visited.add(curr)

  9. An interesting property... Note: We visited the nodes in “rings” – maintained a gradually growing “frontier” of nodes. a b d c e f g h i j 7

  10. An interesting property... Note: We visited the nodes in “rings” – maintained a gradually growing “frontier” of nodes. a b d c e f g h i j 7

  11. An interesting property... Note: We visited the nodes in “rings” – maintained a gradually growing “frontier” of nodes. a b d c e f g h i j 7

  12. An interesting property... Note: We visited the nodes in “rings” – maintained a gradually growing “frontier” of nodes. a b d c e f g h i j 7

  13. An interesting property... Note: We visited the nodes in “rings” – maintained a gradually growing “frontier” of nodes. a b d c e f g h i j 7

  14. An interesting property... Note: We visited the nodes in “rings” – maintained a gradually growing “frontier” of nodes. a b d c e f g h i j 7

  15. An interesting property... What does this look like for trees? The algorithm traverses the width, or “breadth” of the tree 8

  16. An interesting property... What does this look like for trees? The algorithm traverses the width, or “breadth” of the tree 8

  17. An interesting property... What does this look like for trees? The algorithm traverses the width, or “breadth” of the tree 8

  18. An interesting property... What does this look like for trees? The algorithm traverses the width, or “breadth” of the tree 8

  19. An interesting property... What does this look like for trees? The algorithm traverses the width, or “breadth” of the tree 8

  20. search(v): search(v): visited = empty set visited = empty set stack.push(v) queue.enqueue(v) visited.add(v) visited.add(v) while (stack is not empty): while (queue is not empty): curr = stack.pop() curr = queue.dequeue() visited.add(curr) for (w : v.neighbors()): for (w : v.neighbors()): if (w not in visited): if (w not in visited): queue.enqueue(w) stack.push(w) visited.add(curr) visited.add(v) Depth-fjrst search (DFS) The DFS algorithm: Question: Why a queue? Can we use other data structures? The BFS algorithm: and removes works! For example, what if we try using a stack? Answer: Yes! Any kind of list-like thing that supports appends 9

  21. search(v): search(v): visited = empty set visited = empty set stack.push(v) queue.enqueue(v) visited.add(v) visited.add(v) while (stack is not empty): while (queue is not empty): curr = stack.pop() curr = queue.dequeue() visited.add(curr) for (w : v.neighbors()): for (w : v.neighbors()): if (w not in visited): if (w not in visited): queue.enqueue(w) stack.push(w) visited.add(curr) visited.add(v) Depth-fjrst search (DFS) The DFS algorithm: Question: Why a queue? Can we use other data structures? The BFS algorithm: and removes works! For example, what if we try using a stack? Answer: Yes! Any kind of list-like thing that supports appends 9

  22. search(v): visited = empty set stack.push(v) visited.add(v) while (stack is not empty): curr = stack.pop() visited.add(curr) for (w : v.neighbors()): if (w not in visited): stack.push(w) visited.add(v) Depth-fjrst search (DFS) The DFS algorithm: 9 The BFS algorithm: Question: Why a queue? Can we use other data structures? and removes works! For example, what if we try using a stack? Answer: Yes! Any kind of list-like thing that supports appends search(v): visited = empty set queue.enqueue(v) visited.add(v) while (queue is not empty): curr = queue.dequeue() for (w : v.neighbors()): if (w not in visited): queue.enqueue(w) visited.add(curr)

  23. Depth-fjrst search (DFS) Question: Why a queue? Can we use other data structures? The DFS algorithm: 9 The BFS algorithm: and removes works! For example, what if we try using a stack? Answer: Yes! Any kind of list-like thing that supports appends search(v): search(v): visited = empty set visited = empty set stack.push(v) queue.enqueue(v) visited.add(v) visited.add(v) while (stack is not empty): while (queue is not empty): curr = stack.pop() curr = queue.dequeue() visited.add(curr) for (w : v.neighbors()): for (w : v.neighbors()): if (w not in visited): if (w not in visited): queue.enqueue(w) stack.push(w) visited.add(curr) visited.add(v)

  24. Depth-fjrst search (DFS) example e Visited: a, Stack: a, Current node: j c i h g f d b a 10 search(v): visited = empty set stack.push(v) while (stack is not empty): curr = stack.pop() visited.add(curr) for (w : v.neighbors()): if (w not in visited): stack.push(w)

  25. Depth-fjrst search (DFS) example e Visited: a, Stack: Current node: a j c i h g f d b a 10 search(v): visited = empty set stack.push(v) while (stack is not empty): curr = stack.pop() visited.add(curr) for (w : v.neighbors()): if (w not in visited): stack.push(w)

  26. Depth-fjrst search (DFS) example e Visited: a, b, d, Stack: b, d, Current node: a j c i h g f d b a 10 search(v): visited = empty set stack.push(v) while (stack is not empty): curr = stack.pop() visited.add(curr) for (w : v.neighbors()): if (w not in visited): stack.push(w)

  27. Depth-fjrst search (DFS) example e Visited: a, b, d, Stack: b, Current node: d j c i h g f d b a 10 search(v): visited = empty set stack.push(v) while (stack is not empty): curr = stack.pop() visited.add(curr) for (w : v.neighbors()): if (w not in visited): stack.push(w)

  28. Depth-fjrst search (DFS) example e Visited: a, b, d, e, f, g, Stack: b, e, f, g, Current node: d j c i h g f d b a 10 search(v): visited = empty set stack.push(v) while (stack is not empty): curr = stack.pop() visited.add(curr) for (w : v.neighbors()): if (w not in visited): stack.push(w)

  29. Depth-fjrst search (DFS) example e Visited: a, b, d, e, f, g, Stack: b, e, f, Current node: g j c i h g f d b a 10 search(v): visited = empty set stack.push(v) while (stack is not empty): curr = stack.pop() visited.add(curr) for (w : v.neighbors()): if (w not in visited): stack.push(w)

  30. Depth-fjrst search (DFS) example e Visited: a, b, d, e, f, g, h, i, Stack: b, e, f, h, i, Current node: g j c i h g f d b a 10 search(v): visited = empty set stack.push(v) while (stack is not empty): curr = stack.pop() visited.add(curr) for (w : v.neighbors()): if (w not in visited): stack.push(w)

  31. Depth-fjrst search (DFS) example e Visited: a, b, d, e, f, g, h, i, Stack: b, e, f, h, Current node: i j c i h g f d b a 10 search(v): visited = empty set stack.push(v) while (stack is not empty): curr = stack.pop() visited.add(curr) for (w : v.neighbors()): if (w not in visited): stack.push(w)

  32. Depth-fjrst search (DFS) example e Visited: a, b, d, e, f, g, h, i, Stack: b, e, f, Current node: h j c i h g f d b a 10 search(v): visited = empty set stack.push(v) while (stack is not empty): curr = stack.pop() visited.add(curr) for (w : v.neighbors()): if (w not in visited): stack.push(w)

  33. Depth-fjrst search (DFS) example e Visited: a, b, d, e, f, g, h, i, e, Stack: b, e, Current node: f j c i h g f d b a 10 search(v): visited = empty set stack.push(v) while (stack is not empty): curr = stack.pop() visited.add(curr) for (w : v.neighbors()): if (w not in visited): stack.push(w)

  34. Depth-fjrst search (DFS) example e Visited: a, b, d, e, f, g, h, i, e, Stack: b, e, Current node: e j c i h g f d b a 10 search(v): visited = empty set stack.push(v) while (stack is not empty): curr = stack.pop() visited.add(curr) for (w : v.neighbors()): if (w not in visited): stack.push(w)

  35. Depth-fjrst search (DFS) example e Visited: a, b, d, e, f, g, h, i, e, c, Stack: b, e, c, Current node: e j c i h g f d b a 10 search(v): visited = empty set stack.push(v) while (stack is not empty): curr = stack.pop() visited.add(curr) for (w : v.neighbors()): if (w not in visited): stack.push(w)

  36. Depth-fjrst search (DFS) example e Visited: a, b, d, e, f, g, h, i, e, c, Stack: b, Current node: c j c i h g f d b a 10 search(v): visited = empty set stack.push(v) while (stack is not empty): curr = stack.pop() visited.add(curr) for (w : v.neighbors()): if (w not in visited): stack.push(w)

  37. Depth-fjrst search (DFS) example e Visited: a, b, d, e, f, g, h, i, e, c, Stack: Current node: b j c i h g f d b a 10 search(v): visited = empty set stack.push(v) while (stack is not empty): curr = stack.pop() visited.add(curr) for (w : v.neighbors()): if (w not in visited): stack.push(w)

  38. Depth-fjrst search (DFS) example e Visited: a, b, d, e, f, g, h, i, e, c, Stack: Current node: j c i h g f d b a 10 search(v): visited = empty set stack.push(v) while (stack is not empty): curr = stack.pop() visited.add(curr) for (w : v.neighbors()): if (w not in visited): stack.push(w)

  39. search(v): visited = empty set stack.push(v) visited.add(v) while (stack is not empty): curr = stack.pop() for (w : v.neighbors()): if (w not in visited): stack.push(w) visited.add(curr) Depth-fjrst search (DFS) Depth-fjrst traversal, core idea: Pseudocode: for same reasons as BFS E V 2. Runtime: also everything the same. 1. Instead of using a queue, use a stack. Otherwise, keep 11

  40. search(v): visited = empty set stack.push(v) visited.add(v) while (stack is not empty): curr = stack.pop() for (w : v.neighbors()): if (w not in visited): stack.push(w) visited.add(curr) Depth-fjrst search (DFS) Depth-fjrst traversal, core idea: Pseudocode: everything the same. 1. Instead of using a queue, use a stack. Otherwise, keep 11 2. Runtime: also O ( | V | + | E | ) for same reasons as BFS

  41. Depth-fjrst search (DFS) Pseudocode: Depth-fjrst traversal, core idea: 11 everything the same. 1. Instead of using a queue, use a stack. Otherwise, keep 2. Runtime: also O ( | V | + | E | ) for same reasons as BFS search(v): visited = empty set stack.push(v) visited.add(v) while (stack is not empty): curr = stack.pop() for (w : v.neighbors()): if (w not in visited): stack.push(w) visited.add(curr)

  42. An interesting property... Note: Rather the growing the node in “rings”, we randomly wandered through the graph until we got stuck, then “backtracked”. a b d c e f g h i j 12

  43. An interesting property... Note: Rather the growing the node in “rings”, we randomly wandered through the graph until we got stuck, then “backtracked”. a b d c e f g h i j 12

  44. An interesting property... Note: Rather the growing the node in “rings”, we randomly wandered through the graph until we got stuck, then “backtracked”. a b d c e f g h i j 12

  45. An interesting property... Note: Rather the growing the node in “rings”, we randomly wandered through the graph until we got stuck, then “backtracked”. a b d c e f g h i j 12

  46. An interesting property... Note: Rather the growing the node in “rings”, we randomly wandered through the graph until we got stuck, then “backtracked”. a b d c e f g h i j 12

  47. An interesting property... Note: Rather the growing the node in “rings”, we randomly wandered through the graph until we got stuck, then “backtracked”. a b d c e f g h i j 12

  48. An interesting property... Note: Rather the growing the node in “rings”, we randomly wandered through the graph until we got stuck, then “backtracked”. a b d c e f g h i j 12

  49. An interesting property... Note: Rather the growing the node in “rings”, we randomly wandered through the graph until we got stuck, then “backtracked”. a b d c e f g h i j 12

  50. An interesting property... Note: Rather the growing the node in “rings”, we randomly wandered through the graph until we got stuck, then “backtracked”. a b d c e f g h i j 12

  51. An interesting property... Note: Rather the growing the node in “rings”, we randomly wandered through the graph until we got stuck, then “backtracked”. a b d c e f g h i j 12

  52. An interesting property... Note: Rather the growing the node in “rings”, we randomly wandered through the graph until we got stuck, then “backtracked”. a b d c e f g h i j 12

  53. An interesting property... Note: Rather the growing the node in “rings”, we randomly wandered through the graph until we got stuck, then “backtracked”. a b d c e f g h i j 12

  54. An interesting property... Note: Rather the growing the node in “rings”, we randomly wandered through the graph until we got stuck, then “backtracked”. a b d c e f g h i j 12

  55. An interesting property... Note: Rather the growing the node in “rings”, we randomly wandered through the graph until we got stuck, then “backtracked”. a b d c e f g h i j 12

  56. An interesting property... Note: Rather the growing the node in “rings”, we randomly wandered through the graph until we got stuck, then “backtracked”. a b d c e f g h i j 12

  57. An interesting property... Note: Rather the growing the node in “rings”, we randomly wandered through the graph until we got stuck, then “backtracked”. a b d c e f g h i j 12

  58. An interesting property... Note: Rather the growing the node in “rings”, we randomly wandered through the graph until we got stuck, then “backtracked”. a b d c e f g h i j 12

  59. An interesting property... Note: Rather the growing the node in “rings”, we randomly wandered through the graph until we got stuck, then “backtracked”. a b d c e f g h i j 12

  60. An interesting property... What does this look like for trees? The algorithm traverses to the bottom fjrst: it prioritizes the “depth” of the tree Note: rest of algorithm omitted 13

  61. An interesting property... What does this look like for trees? The algorithm traverses to the bottom fjrst: it prioritizes the “depth” of the tree Note: rest of algorithm omitted 13

  62. An interesting property... What does this look like for trees? The algorithm traverses to the bottom fjrst: it prioritizes the “depth” of the tree Note: rest of algorithm omitted 13

  63. An interesting property... What does this look like for trees? The algorithm traverses to the bottom fjrst: it prioritizes the “depth” of the tree Note: rest of algorithm omitted 13

  64. An interesting property... What does this look like for trees? The algorithm traverses to the bottom fjrst: it prioritizes the “depth” of the tree Note: rest of algorithm omitted 13

  65. An interesting property... What does this look like for trees? The algorithm traverses to the bottom fjrst: it prioritizes the “depth” of the tree Note: rest of algorithm omitted 13

  66. An interesting property... What does this look like for trees? The algorithm traverses to the bottom fjrst: it prioritizes the “depth” of the tree Note: rest of algorithm omitted 13

  67. An interesting property... What does this look like for trees? The algorithm traverses to the bottom fjrst: it prioritizes the “depth” of the tree Note: rest of algorithm omitted 13

  68. An interesting property... What does this look like for trees? The algorithm traverses to the bottom fjrst: it prioritizes the “depth” of the tree Note: rest of algorithm omitted 13

  69. Compare and contrast Question: When do we use BFS vs DFS? Related question: How much memory does BFS and DFS use in the worst case? BFS: V – what if every node is connected to the start? DFS: V – what if the nodes are arranged like a linked list? So, in the worst case, BFS and DFS both have the same worst-case runtime and memory usage. They only difger in what order they visit the nodes. 14

  70. Compare and contrast Question: When do we use BFS vs DFS? Related question: How much memory does BFS and DFS use in the worst case? V – what if every node is connected to the start? V – what if the nodes are arranged like a linked list? So, in the worst case, BFS and DFS both have the same worst-case runtime and memory usage. They only difger in what order they visit the nodes. 14 ◮ BFS: ◮ DFS:

  71. Compare and contrast Question: When do we use BFS vs DFS? Related question: How much memory does BFS and DFS use in the worst case? list? So, in the worst case, BFS and DFS both have the same worst-case runtime and memory usage. They only difger in what order they visit the nodes. 14 ◮ BFS: O ( | V | ) – what if every node is connected to the start? ◮ DFS: O ( | V | ) – what if the nodes are arranged like a linked

  72. Compare and contrast How much memory does BFS and DFS use in the average case? Related question: how much memory do they use when we want to traverse a tree? BFS: “width” of tree num leaves DFS: height For graphs: Use BFS if graph is “narrow”, or if solution is “near” start Use DFS if graph is “wide” In practice, graphs are often large/very wide, so DFS is often a good default choice. (It’s also possible to implement DFS recursively!) 15

  73. Compare and contrast How much memory does BFS and DFS use in the average case? Related question: how much memory do they use when we want to traverse a tree? BFS: “width” of tree num leaves DFS: height For graphs: Use BFS if graph is “narrow”, or if solution is “near” start Use DFS if graph is “wide” In practice, graphs are often large/very wide, so DFS is often a good default choice. (It’s also possible to implement DFS recursively!) 15

  74. Compare and contrast How much memory does BFS and DFS use in the average case? Related question: how much memory do they use when we want to traverse a tree? “width” of tree num leaves height For graphs: Use BFS if graph is “narrow”, or if solution is “near” start Use DFS if graph is “wide” In practice, graphs are often large/very wide, so DFS is often a good default choice. (It’s also possible to implement DFS recursively!) 15 ◮ BFS: ◮ DFS:

  75. Compare and contrast How much memory does BFS and DFS use in the average case? Related question: how much memory do they use when we want to traverse a tree? For graphs: Use BFS if graph is “narrow”, or if solution is “near” start Use DFS if graph is “wide” In practice, graphs are often large/very wide, so DFS is often a good default choice. (It’s also possible to implement DFS recursively!) 15 ◮ BFS: O ( “width” of tree ) = O ( num leaves ) ◮ DFS: O ( height )

Recommend

Graph Traversal Graph Traversal with DFS/BFS One of the most fundamental graph problems is to

Graph Traversal Graph Traversal with DFS/BFS One of the most fundamental graph problems is to

Graph Traversal Graph Traversal with DFS/BFS One of the most fundamental graph problems is to traverse every Tyler Moore edge and vertex in a graph. CSE 3353, SMU, Dallas, TX For correctness, we must do the traversal in a systematic way so

736 views • 5 slides
Graph traversal anhtt-fit@mail.hut.edu.vn Graph Traversal We need also algorithm to traverse

Graph traversal anhtt-fit@mail.hut.edu.vn Graph Traversal We need also algorithm to traverse

Graph traversal anhtt-fit@mail.hut.edu.vn Graph Traversal We need also algorithm to traverse a graph like for a tree Graph traversal may start at an arbitrary vertex. (Tree traversal generally starts at root vertex) Two difficulties

339 views • 6 slides
graph traversal Nov. 15/16, 2017 1 Today Recursive graph traversal depth first

graph traversal Nov. 15/16, 2017 1 Today Recursive graph traversal depth first

COMP 250 Lecture 29 graph traversal Nov. 15/16, 2017 1 Today Recursive graph traversal depth first Non-recursive graph traversal depth first breadth first 2 Heads up! There were a few mistakes in the slides for Sec. 001

732 views • 48 slides
GRAPH TRAVERSAL PATH FINDING AND GRAPH TRAVERSAL Path finding refers to determining the shortest

GRAPH TRAVERSAL PATH FINDING AND GRAPH TRAVERSAL Path finding refers to determining the shortest

GRAPH TRAVERSAL PATH FINDING AND GRAPH TRAVERSAL Path finding refers to determining the shortest path between two vertices in a graph. We discussed the FloydWarshall algorithm previously, but you may achieve similar results with the Dijkstra

301 views • 26 slides
ECE 242 Data Structures Lecture 29 Graph Traversal November 23, 2009 ECE242 L29: Graph

ECE 242 Data Structures Lecture 29 Graph Traversal November 23, 2009 ECE242 L29: Graph

ECE 242 Data Structures Lecture 29 Graph Traversal November 23, 2009 ECE242 L29: Graph Traversal Overview Problem: How can we efficiently visit all vertices in the graph? Depth first search Quickly follow paths between vertices

532 views • 19 slides
Graph: representation and traversal CISC4080, Computer Algorithms CIS, Fordham Univ.

Graph: representation and traversal CISC4080, Computer Algorithms CIS, Fordham Univ.

Graph: representation and traversal CISC4080, Computer Algorithms CIS, Fordham Univ. Instructor: X. Zhang Outline Graph Definition Graph Representation Path, Cycle, Tree, Connectivity Graph Traversal Algorithms Breath

663 views • 40 slides
Graph Traversals Graph traversal (BFS and DFS) G can be undirected or directed We

Graph Traversals Graph traversal (BFS and DFS) G can be undirected or directed We

csci 210: Data Structures Graph Traversals Graph traversal (BFS and DFS) G can be undirected or directed We think about coloring each vertex WHITE before we start GRAY after we visit a vertex but before we visited all its

533 views • 10 slides
13. Graphs Notation, Representation, Graph Traversal (DFS, BFS), Topological Sorting

13. Graphs Notation, Representation, Graph Traversal (DFS, BFS), Topological Sorting

K onigsberg 1736 13. Graphs Notation, Representation, Graph Traversal (DFS, BFS), Topological Sorting [Ottman/Widmayer, Kap. 9.1 - 9.4,Cormen et al, Kap. 22] 307 308 [Multi]Graph Cycles Is there a cycle through the town (the edge graph)

318 views • 11 slides
CSE 373: Graph traversal Visited: a, b, d, c, e, f, g, h, i, d c e f g h i j Current

CSE 373: Graph traversal Visited: a, b, d, c, e, f, g, h, i, d c e f g h i j Current

CSE 373: Graph traversal Visited: a, b, d, c, e, f, g, h, i, d c e f g h i j Current node: a b d c e f g h i Queue: a, b, d, c, e, f, g, h, i, 4 a Breadth-fjrst search (BFS) Breadth-fjrst traversal, core idea: 1. Use something (e.g.

357 views • 7 slides
Objectives Graphs Graph Connectivity, Traversal BFS & DFS Implementations, Analysis

Objectives Graphs Graph Connectivity, Traversal BFS & DFS Implementations, Analysis

1/28/19 Objectives Graphs Graph Connectivity, Traversal BFS & DFS Implementations, Analysis Jan 28, 2019 CSCI211 - Sprenkle 1 Review What is a heap? When is it useful? What is a graph? What are two ways to

414 views • 17 slides
Objec&ves Graphs Graph Connec&vity, Traversal BFS & DFS Implementa&ons,

Objec&ves Graphs Graph Connec&vity, Traversal BFS & DFS Implementa&ons,

1/29/18 Objec&ves Graphs Graph Connec&vity, Traversal BFS & DFS Implementa&ons, Analysis Jan 29, 2018 CSCI211 - Sprenkle 1 Review What is a heap? When is it useful? What is a graph? What is one way to

492 views • 14 slides
CMSC 132: Object-Oriented Programming II Graphs & Graph Traversal Department of Computer

CMSC 132: Object-Oriented Programming II Graphs & Graph Traversal Department of Computer

CMSC 132: Object-Oriented Programming II Graphs & Graph Traversal Department of Computer Science University of Maryland, College Park Graph Data Structures Many-to-many relationship between elements Each element has multiple

277 views • 25 slides
EXPLOITING LOCALITY IN GRAPH ANALYTICS THROUGH HARDWARE ACCELERATED TRAVERSAL SCHEDULING Anurag

EXPLOITING LOCALITY IN GRAPH ANALYTICS THROUGH HARDWARE ACCELERATED TRAVERSAL SCHEDULING Anurag

EXPLOITING LOCALITY IN GRAPH ANALYTICS THROUGH HARDWARE ACCELERATED TRAVERSAL SCHEDULING Anurag Mukkara , Nathan Beckmann, Maleen Abeydeera, Xiaosong Ma, Daniel Sanchez MICRO 2018 The locality problem of graph processing 2 Irregular

672 views • 22 slides
Graph Traversal Breadth First Search Breadth First Search (BFS) Idea Explore graph layer by

Graph Traversal Breadth First Search Breadth First Search (BFS) Idea Explore graph layer by

Graph Traversal Breadth First Search Breadth First Search (BFS) Idea Explore graph layer by layer from a start vertex s . s . . . Layer 0 Layer 1 Layer 2 3 / 16 BFS Applications Finding a shortest path. Determine distances.

889 views • 35 slides
Hierarchical Graph Traversal for Aggregate k Nearest Neighbors Search in Road Networks ICAPS

Hierarchical Graph Traversal for Aggregate k Nearest Neighbors Search in Road Networks ICAPS

Hierarchical Graph Traversal for Aggregate k Nearest Neighbors Search in Road Networks ICAPS 2020 SEMINAR PRESENTER: TENINDRA ABEYWICKRAMA CO-AUTHORS: MUHAMMAD AAMIR CHEEMA, SABINE STORANDT Background: Road Network Graph Input: Road

377 views • 19 slides
Graph Traversal Section 4.14.2 Dr. Mayfield and Dr. Lam Department of Computer Science James

Graph Traversal Section 4.14.2 Dr. Mayfield and Dr. Lam Department of Computer Science James

Graph Traversal Section 4.14.2 Dr. Mayfield and Dr. Lam Department of Computer Science James Madison University Oct 30, 2015 Reminder Portfolio 7 due in two weeks Submit four new problems (seven total) You may replace/improve

651 views • 18 slides
The More the Merrier: Efficient Multi-Source Graph Traversal Manuel Then * , Moritz Kaufmann * ,

The More the Merrier: Efficient Multi-Source Graph Traversal Manuel Then * , Moritz Kaufmann * ,

The More the Merrier: Efficient Multi-Source Graph Traversal Manuel Then * , Moritz Kaufmann * , Fernando Chirigati , Tuan-Anh Hoang-Vu , Kien Pham , Huy T. Vo , Alfons Kemper * , Thomas Neumann * * Technische Universit t M

491 views • 37 slides
CS 225 Data Structures April 16 Graph Traversal Wad ade Fag agen-Ulm lmschneid ider

CS 225 Data Structures April 16 Graph Traversal Wad ade Fag agen-Ulm lmschneid ider

CS 225 Data Structures April 16 Graph Traversal Wad ade Fag agen-Ulm lmschneid ider Graph ADT Functions: - insertVertex(K key); Data: - insertEdge(Vertex v1, Vertex v2, K key); - Vertices - Edges - removeVertex(Vertex v); - Some data

442 views • 20 slides
Solving Sudoku Puzzles Constraint propagation, Graph traversal, and Backtracking Constraint

Solving Sudoku Puzzles Constraint propagation, Graph traversal, and Backtracking Constraint

Solving Sudoku Puzzles Constraint propagation, Graph traversal, and Backtracking Constraint Satisfaction Given some constraints, can I find a solution? e.g. Given the contents of my fridge, is there a nutritious dinner to be made?

790 views • 13 slides
Graph: representation and traversal CISC5835, Computer Algorithms CIS, Fordham Univ.

Graph: representation and traversal CISC5835, Computer Algorithms CIS, Fordham Univ.

Graph: representation and traversal CISC5835, Computer Algorithms CIS, Fordham Univ. Instructor: X. Zhang Acknowledgement The set of slides have use materials from the following resources Slides for textbook by Dr. Y. Chen from

811 views • 70 slides
Solving Mazes Constraint propagation, Graph traversal, and Backtracking Constraint Satisfaction

Solving Mazes Constraint propagation, Graph traversal, and Backtracking Constraint Satisfaction

Solving Mazes Constraint propagation, Graph traversal, and Backtracking Constraint Satisfaction Given some constraints, can I find a solution? e.g. Given the contents of my fridge, is there a nutritious dinner to be made? e.g. Can we

487 views • 14 slides
GPU GRAPH TRAVERSAL ADAM MCLAUGHLIN * , INDRANI PAUL , JOSEPH GREATHOUSE , SRILATHA MANNE

GPU GRAPH TRAVERSAL ADAM MCLAUGHLIN * , INDRANI PAUL , JOSEPH GREATHOUSE , SRILATHA MANNE

A POWER CHARACTERIZATION AND MANAGEMENT OF GPU GRAPH TRAVERSAL ADAM MCLAUGHLIN * , INDRANI PAUL , JOSEPH GREATHOUSE , SRILATHA MANNE , AND SUDHAKAR YALAMANCHILI * * GEORGIA INSTITUTE OF TECHNOLOGY AMD RESEARCH MOTIVATION

330 views • 21 slides
Scalable GPU graph traversal BFS Compressed Row Format Sequential BFS Parallel BFS

Scalable GPU graph traversal BFS Compressed Row Format Sequential BFS Parallel BFS

Scalable GPU graph traversal BFS Compressed Row Format Sequential BFS Parallel BFS Quadratic parallelizations - O(n^2+m) Linear parallelizations - O(n+m) Frontiers may be maintained in-core or out-of-core Distributed

359 views • 20 slides
Graph traversal Topological sort Breadth-first search Cinda Heeren / Andy Roth / Will Evans /

Graph traversal Topological sort Breadth-first search Cinda Heeren / Andy Roth / Will Evans /

Graph traversal Topological sort Breadth-first search Cinda Heeren / Andy Roth / Will Evans / March 27, 2020 1 Geoffrey Tien Announcements All CPSC 221 deadlines postponed to 23:59, Apr.09 TA evaluations and instructor/course

202 views • 17 slides

More recommend