cs 401 computer algorithm i
play

CS 401: Computer Algorithm I DFS / Topological Ordering Xiaorui - PowerPoint PPT Presentation

Apr 19, 2023 •359 likes •913 views

CS 401: Computer Algorithm I DFS / Topological Ordering Xiaorui Sun 1 BFS Application: Testing Bipartiteness Problem: Given a graph ! , is it bipartite? Many graph problems become: Easier/Tractable if the underlying graph is bipartite

  1. CS 401: Computer Algorithm I DFS / Topological Ordering Xiaorui Sun 1

  2. BFS Application: Testing Bipartiteness Problem: Given a graph ! , is it bipartite? Many graph problems become: • Easier/Tractable if the underlying graph is bipartite (matching) Before attempting to design an algorithm, we need to understand structure of bipartite graphs. v 2 v 2 v 3 v 1 v 4 v 6 v 5 v 4 v 3 v 5 v 6 v 7 v 1 v 7 a bipartite graph G another drawing of G 2

  3. A Characterization of Bipartite Graphs Lemma: Let ! be a connected graph, and let " 0 , … , " & be the layers produced by BFS( ' ). Exactly one of the following holds. (i) No edge of ! joins two nodes of the same layer, and ! is bipartite. (ii) An edge of ! joins two nodes of the same layer, and ! contains an odd-length cycle (and hence is not bipartite). L 1 L 2 L 3 L 2 L 3 L 1 3 Case (ii) Case (i)

  4. Obstruction to Bipartiteness Corollary: A graph ! is bipartite if and only if it contains no odd length cycles. Furthermore, one can test bipartiteness using BFS. Bipartiteness algorithm: • Run BFS on an arbitrary vertex • If there is a non-tree edge connecting two vertices at the same level of the BFS tree, then the graph is not a bipartite graph, otherwise, the graph is a bipartite graph. 4

  5. BFS Summary Breadth First Search (BFS): Explore vertices according to the order of the discovery of vertices Property: • BFS tree • Level = distance (length of shortest path) from the initial vertex • Every edge connect two vertices at the same or adjacent levels Applications of BFS: • Finding connected components of a graph 5 • Testing bipartiteness

  6. Depth First Search Follow the first path you find as far as you can go; back up to last unexplored edge when you reach a dead end, then go as far you can Naturally implemented using recursive calls or a stack 6

  7. DFS(s) – Recursive version Initialization: mark all vertices undiscovered DFS( ! ) Mark ! discovered for each edge {!, $} if ( $ is undiscovered) DFS( $ ) Mark ! fully-explored 7

  8. Color code: DFS(A) undiscovered discovered fully-explored A,1 Suppose edge lists Call Stack at each vertex (Edge list): are sorted B J alphabetically A (B,J) C G H K L D F M I st[] = {1} E 8

  9. Color code: DFS(A) undiscovered discovered fully-explored A,1 Call Stack: (Edge list) B,2 J A (B,J) B (A,C,J) C G H K L D F M I st[] = {1,2} E 9

  10. Color code: DFS(A) undiscovered discovered fully-explored A,1 Call Stack: (Edge list) B,2 J A (B,J) B (A,C,J) C,3 C (B,D,G,H) G H K L D F M I st[] = {1,2,3} E 10

  11. Color code: DFS(A) undiscovered discovered fully-explored A,1 Call Stack: (Edge list) B,2 J A (B,J) B (A,C,J) C,3 C (B,D,G,H) D (C,E,F) G H K L D,4 F M I st[] = {1,2,3,4} E 11

  12. Color code: DFS(A) undiscovered discovered fully-explored A,1 Call Stack: (Edge list) B,2 J A (B,J) B (A,C,J) C,3 C (B,D,G,H) D (C,E,F) E (D,F) G H K L D,4 F M I st[] = {1,2,3,4,5} E,5 12

  13. Color code: DFS(A) undiscovered discovered fully-explored A,1 Call Stack: (Edge list) B,2 J A (B,J) B (A,C,J) C,3 C (B,D,G,H) D (C,E,F) E (D,F) G H K L F (D,E,G) D,4 F,6 M I st[] = {1,2,3,4,5, 6} E,5 13

  14. Color code: DFS(A) undiscovered discovered fully-explored A,1 Call Stack: (Edge list) B,2 J A (B,J) B (A,C,J) C,3 C (B,D,G,H) D (C,E,F) E (D,F) G,7 H K L F (D,E,G) G(C,F) D,4 F,6 M I st[] = {1,2,3,4,5, 6,7} E,5 14

  15. Color code: DFS(A) undiscovered discovered fully-explored A,1 Call Stack: (Edge list) B,2 J A (B,J) B (A,C,J) C,3 C (B,D,G,H) D (C,E,F) E (D,F) G,7 H K L F (D,E,G) G(C,F) D,4 F,6 M I st[] = {1,2,3,4,5, 6,7} E,5 15

  16. Color code: DFS(A) undiscovered discovered fully-explored A,1 Call Stack: (Edge list) B,2 J A (B,J) B (A,C,J) C,3 C (B,D,G,H) D (C,E,F) E (D,F) H K L G,7 F (D,E,G) D,4 F,6 M I st[] = {1,2,3,4,5, 6} E,5 16

  17. Color code: DFS(A) undiscovered discovered fully-explored A,1 Call Stack: (Edge list) B,2 J A (B,J) B (A,C,J) C,3 C (B,D,G,H) D (C,E,F) E (D,F) H K L G,7 D,4 F,6 M I st[] = {1,2,3,4,5} E,5 17

  18. Color code: DFS(A) undiscovered discovered fully-explored A,1 Call Stack: (Edge list) B,2 J A (B,J) B (A,C,J) C,3 C (B,D,G,H) D (C,E,F) H K L G,7 D,4 F,6 M I st[] = {1,2,3,4} E,5 18

  19. Color code: DFS(A) undiscovered discovered fully-explored A,1 Call Stack: (Edge list) B,2 J A (B,J) B (A,C,J) C,3 C (B,D,G,H) H K L G,7 D,4 F,6 M I st[] = {1,2,3} E,5 19

  20. Color code: DFS(A) undiscovered discovered fully-explored A,1 Call Stack: (Edge list) B,2 J A (B,J) B (A,C,J) C,3 C (B,D,G,H) H (C,I,J) H,8 K L G,7 D,4 F,6 M I st[] = {1,2,3,8} E,5 20

  21. Color code: DFS(A) undiscovered discovered fully-explored A,1 Call Stack: (Edge list) B,2 J A (B,J) B (A,C,J) C,3 C (B,D,G,H) H (C,I,J) I (H) H,8 K L G,7 D,4 F,6 I,9 M st[] = {1,2,3,8,9} E,5 21

  22. Color code: DFS(A) undiscovered discovered fully-explored A,1 Call Stack: (Edge list) B,2 J A (B,J) B (A,C,J) C,3 C (B,D,G,H) H (C,I,J) H,8 K L G,7 D,4 F,6 I,9 M st[] = {1,2,3,8} E,5 22

  23. Color code: DFS(A) undiscovered discovered fully-explored A,1 Call Stack: (Edge list) B,2 J,10 A (B,J) B (A,C,J) C,3 C (B,D,G,H) H (C,I,J) J (A,B,H,K,L) H,8 K L G,7 D,4 F,6 I,9 M st[] = {1,2,3,8, 10} E,5 23

  24. Color code: DFS(A) undiscovered discovered fully-explored A,1 Call Stack: (Edge list) B,2 J,10 A (B,J) B (A,C,J) C,3 C (B,D,G,H) H (C,I,J) J (A,B,H,K,L) H,8 K,11 L G,7 K (J,L) D,4 F,6 I,9 M st[] = {1,2,3,8,10 ,11} E,5 24

  25. Color code: DFS(A) undiscovered discovered fully-explored A,1 Call Stack: (Edge list) B,2 J,10 A (B,J) B (A,C,J) C,3 C (B,D,G,H) H (C,I,J) J (A,B,H,K,L) H,8 K,11 L,12 G,7 K (J,L) L (J,K,M) D,4 F,6 I,9 M st[] = {1,2,3,8,10 ,11,12} E,5 25

  26. Color code: DFS(A) undiscovered discovered fully-explored A,1 Call Stack: (Edge list) B,2 J,10 A (B,J) B (A,C,J) C,3 C (B,D,G,H) H (C,I,J) J (A,B,H,K,L) H,8 K,11 L,12 G,7 K (J,L) L (J,K,M) M(L) D,4 F,6 I,9 M,13 st[] = {1,2,3,8,10 ,11,12,13} E,5 26

  27. Color code: DFS(A) undiscovered discovered fully-explored A,1 Call Stack: (Edge list) B,2 J,10 A (B,J) B (A,C,J) C,3 C (B,D,G,H) H (C,I,J) J (A,B,H,K,L) H,8 K,11 L,12 G,7 K (J,L) L (J,K,M) D,4 F,6 I,9 M,13 st[] = {1,2,3,8,10 ,11,12} E,5 27

  28. Color code: DFS(A) undiscovered discovered fully-explored A,1 Call Stack: (Edge list) B,2 J,10 A (B,J) B (A,C,J) C,3 C (B,D,G,H) H (C,I,J) J (A,B,H,K,L) H,8 K,11 L,12 G,7 K (J,L) D,4 F,6 I,9 M,13 st[] = {1,2,3,8,10 ,11} E,5 28

  29. Color code: DFS(A) undiscovered discovered fully-explored A,1 Call Stack: (Edge list) B,2 J,10 A (B,J) B (A,C,J) C,3 C (B,D,G,H) H (C,I,J) J (A,B,H,K,L) H,8 K,11 L,12 G,7 D,4 F,6 I,9 M,13 st[] = {1,2,3,8, 10} E,5 29

  30. Color code: DFS(A) undiscovered discovered fully-explored A,1 Call Stack: (Edge list) B,2 J,10 A (B,J) B (A,C,J) C,3 C (B,D,G,H) H (C,I,J) J (A,B,H,K,L) H,8 K,11 L,12 G,7 D,4 F,6 I,9 M,13 st[] = {1,2,3,8, 10} E,5 30

  31. Color code: DFS(A) undiscovered discovered fully-explored A,1 Call Stack: (Edge list) B,2 J,10 A (B,J) B (A,C,J) C,3 C (B,D,G,H) H (C,I,J) H,8 K,11 L,12 G,7 D,4 F,6 I,9 M,13 st[] = {1,2,3,8} E,5 31

  32. Color code: DFS(A) undiscovered discovered fully-explored A,1 Call Stack: (Edge list) B,2 J,10 A (B,J) B (A,C,J) C,3 C (B,D,G,H) H,8 K,11 L,12 G,7 D,4 F,6 I,9 M,13 st[] = {1,2,3} E,5 32

  33. Color code: DFS(A) undiscovered discovered fully-explored A,1 Call Stack: (Edge list) B,2 J,10 A (B,J) B (A,C,J) C,3 H,8 K,11 L,12 G,7 D,4 F,6 I,9 M,13 st[] = {1,2} E,5 33

  34. Color code: DFS(A) undiscovered discovered fully-explored A,1 Call Stack: (Edge list) B,2 J,10 A (B,J) B (A,C,J) C,3 H,8 K,11 L,12 G,7 D,4 F,6 I,9 M,13 st[] = {1,2} E,5 34

  35. Color code: DFS(A) undiscovered discovered fully-explored A,1 Call Stack: (Edge list) B,2 J,10 A (B,J) C,3 H,8 K,11 L,12 G,7 D,4 F,6 I,9 M,13 st[] = {1} E,5 35

  36. Color code: DFS(A) undiscovered discovered fully-explored A,1 Call Stack: (Edge list) B,2 J,10 A (B,J) C,3 H,8 K,11 L,12 G,7 D,4 F,6 I,9 M,13 st[] = {1} E,5 36

  37. Color code: DFS(A) undiscovered discovered fully-explored A,1 Call Stack: (Edge list) B,2 J,10 TA-DA!! C,3 H,8 K,11 L,12 G,7 D,4 F,6 I,9 M,13 st[] = {} E,5 37

  38. DFS(A) Edge code: Tree edge Back edge A,1 B,2 J,10 C,3 H,8 K,11 L,12 G,7 D,4 F,6 I,9 M,13 E,5 38

  39. Edge code: DFS(A) A,1 Tree edge Back edge B,2 No Cross Edges! C,3 H,8 D,4 J,10 E,5 I,9 K,11 F,6 L,12 G,7 M,13 39

  40. Properties of (undirected) DFS Like BFS( ! ): • DFS( ! ) visits " iff there is a path in G from ! to " So, we can use DFS to find connected components • Edges into then-undiscovered vertices define a tree – the "depth first spanning tree" of G Unlike the BFS tree: • The DF spanning tree isn't minimum depth • Its levels don't reflect min distance from the root • Non-tree edges never join vertices on the same or adjacent levels 40

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Algorithm Analysis Fall 2013 Carola Wenk Computer Program Algorithm Computer Input

Algorithm Analysis Fall 2013 Carola Wenk Computer Program Algorithm Computer Input

Algorithm Analysis Fall 2013 Carola Wenk Computer Program Algorithm Computer Input Output Nearly every modern electronic device can be thought of as a computer that transforms input to the desired output. Computer Program

393 views • 16 slides
The Eight-Point Algorithm COMPSCI 527 Computer Vision COMPSCI 527 Computer Vision The

The Eight-Point Algorithm COMPSCI 527 Computer Vision COMPSCI 527 Computer Vision The

The Eight-Point Algorithm COMPSCI 527 Computer Vision COMPSCI 527 Computer Vision The Eight-Point Algorithm 1 / 17 Outline 1 Summary: The Epipolar Constraint 2 The Eight-Point Algorithm: t , R 3 Triangulation: P m 4 Bundle Adjustment

579 views • 17 slides
What is an Algorithm? Quite generally, an algorithm is a set of instructions that lead to

What is an Algorithm? Quite generally, an algorithm is a set of instructions that lead to

What is an Algorithm? Quite generally, an algorithm is a set of instructions that lead to some desired Fundamentals: All About result Algorithms Must first decompose a problem, and then express its method of solution as a Computer

407 views • 7 slides
Computer Programming II Algorithm Analysis and Sorting Techniques Algorithm A sequence of

Computer Programming II Algorithm Analysis and Sorting Techniques Algorithm A sequence of

Computer Programming II Algorithm Analysis and Sorting Techniques Algorithm A sequence of well-defined instructions, which with a finite number of steps solves a problem or calculation. Components Sequence: a succession of instructions

654 views • 38 slides
Programming Applications What is Computer Programming? An algorithm is a series of steps for

Programming Applications What is Computer Programming? An algorithm is a series of steps for

Programming Applications What is Computer Programming? An algorithm is a series of steps for solving a problem A programming language is a way to express our algorithm to a computer Programming is the process of writing instructions

527 views • 16 slides
Algorithms and Algorithm Analysis Etymology of Algorithm Algorism = process of doing

Algorithms and Algorithm Analysis Etymology of Algorithm Algorism = process of doing

CS206 CS206 Algorithms and Algorithm Analysis Etymology of Algorithm Algorism = process of doing arithmetic using Arabic numerals. Algorithm: A clearly specified set of instructions the computer A misperception: algiros [painful] +

314 views • 4 slides
Visible Surface Determination CS418 Computer Graphics John C. Hart Painters Algorithm

Visible Surface Determination CS418 Computer Graphics John C. Hart Painters Algorithm

Visible Surface Determination CS418 Computer Graphics John C. Hart Painters Algorithm Painters Algorithm Painters Algorithm Painters Algorithm Painters Algorithm Painters Algorithm Backface Culling Q: How does Bob

741 views • 23 slides
CS 171: Introduction to Computer Science II Algorithm Analysis Li Xiong Announcement/Reminders

CS 171: Introduction to Computer Science II Algorithm Analysis Li Xiong Announcement/Reminders

CS 171: Introduction to Computer Science II Algorithm Analysis Li Xiong Announcement/Reminders Hw3 due Friday Quiz 2 on October 17, Wednesday (after Spring break, based on class poll) Linked List, Algorithm Analysis Road Map

349 views • 30 slides
Introduction to Programming Algorithm and Flowchart 1 What is in a Computer? Computer:

Introduction to Programming Algorithm and Flowchart 1 What is in a Computer? Computer:

Introduction to Programming Algorithm and Flowchart 1 What is in a Computer? Computer: Hardware + Software Hardware: Input, Output, CPU (CU, ALU, Memory) Software: System Software and Application Software 2 Computer

909 views • 65 slides
Clustering Genetic Algorithm Petra Kudov Department of Theoretical Computer Science Institute

Clustering Genetic Algorithm Petra Kudov Department of Theoretical Computer Science Institute

Introduction Clustering Genetic Algorithm Experimental results Conclusion Clustering Genetic Algorithm Petra Kudov Department of Theoretical Computer Science Institute of Computer Science Academy of Sciences of the Czech Republic ETID

400 views • 18 slides
Objectives The Pollard p-1 Algorithm The Pollard RHO Algorithm Dixons Random Squares

Objectives The Pollard p-1 Algorithm The Pollard RHO Algorithm Dixons Random Squares

The RSA Cryptosystem: Factoring the public modulus Debdeep Mukhopadhyay Assistant Professor Department of Computer Science and Engineering Indian Institute of Technology Kharagpur INDIA -721302 Objectives The Pollard p-1 Algorithm

289 views • 11 slides
Algorithm Strategies Department of Computer Science University of Maryland, College Park General

Algorithm Strategies Department of Computer Science University of Maryland, College Park General

CMSC 132: Object-Oriented Programming II Algorithm Strategies Department of Computer Science University of Maryland, College Park General Concepts Algorithm strategy Approach to solving a problem May combine several approaches

921 views • 28 slides
The Trickle Algorithm Analysis, Use, and Implementation Philip Levis Computer Systems Lab

The Trickle Algorithm Analysis, Use, and Implementation Philip Levis Computer Systems Lab

The Trickle Algorithm Analysis, Use, and Implementation Philip Levis Computer Systems Lab Stanford University Trickle Summary An algorithm for establishing eventual consistency in a wireless network Establishes consistency quickly

437 views • 25 slides
Is there always an algorithm? An introduction to computability theory. Computer Science

Is there always an algorithm? An introduction to computability theory. Computer Science

Is there always an algorithm? An introduction to computability theory. Computer Science Department Seminar 9th October 2009 Rick Thomas 1 Equations If we want to solve the quadratic equation ax 2 + bx + c = 0 , we know that the solutions are

796 views • 41 slides
Programming by Optimisation: A Practical Paradigm for Computer-Aided Algorithm Design Holger H.

Programming by Optimisation: A Practical Paradigm for Computer-Aided Algorithm Design Holger H.

Programming by Optimisation: A Practical Paradigm for Computer-Aided Algorithm Design Holger H. Hoos , Frank Hutter + , Kevin Leyton-Brown Department of Computer Science + Department of Computer Science University of British Columbia

2.24k views • 196 slides
DEVELOPMENT; DATA TYPES CSCI 135 - Fundamentals of Computer Science I 2 Outline Algorithm

DEVELOPMENT; DATA TYPES CSCI 135 - Fundamentals of Computer Science I 2 Outline Algorithm

ALGORITHM DEVELOPMENT; DATA TYPES CSCI 135 - Fundamentals of Computer Science I 2 Outline Algorithm Development Data Types Type Conversion Comments Algorithms By designing methods, programmers provide actions for objects

584 views • 19 slides
DEVELOPING ELEGANT WORKFLOWS with Apache Airflow Micha Karzy ski EuroPython 2017 ABOUT

DEVELOPING ELEGANT WORKFLOWS with Apache Airflow Micha Karzy ski EuroPython 2017 ABOUT

DEVELOPING ELEGANT WORKFLOWS with Apache Airflow Micha Karzy ski EuroPython 2017 ABOUT ME Micha Karzy ski (@postrational) Full stack geek ( Python , JavaScript and Linux ) I blog at http://michal.karzynski.pl Im a

836 views • 35 slides
Classes of Rational Graphs Christophe Morvan Irisa Journ ees Montoises 2006 1/25 Classes of

Classes of Rational Graphs Christophe Morvan Irisa Journ ees Montoises 2006 1/25 Classes of

Classes of Rational Graphs Classes of Rational Graphs Christophe Morvan Irisa Journ ees Montoises 2006 1/25 Classes of Rational Graphs Plan 1 Definitions Notations Rational Graphs 2 Structure defined families Deterministic Rational

1.21k views • 79 slides
The PROIEL corpora Dag Trygve Truslew Haug Milan, 4 June 2019 Dag Haug PROIEL Milan, 4 June

The PROIEL corpora Dag Trygve Truslew Haug Milan, 4 June 2019 Dag Haug PROIEL Milan, 4 June

The PROIEL corpora Dag Trygve Truslew Haug Milan, 4 June 2019 Dag Haug PROIEL Milan, 4 June 2019 1 / 23 The background A corpus for linguists: focus on making the most of a limited data set for linguistic research Dag Haug PROIEL Milan,

574 views • 41 slides
Relational Data Hierarchies CSC444 Why hierarchies?

Relational Data Hierarchies CSC444 Why hierarchies?

Relational Data Hierarchies CSC444 Why hierarchies? http://www.sci.utah.edu/~miriah/cs6630/lectures/L13-trees-graphs.pdf Scatterplots; dot plots; line charts, etc. Until now, our data points were independent of one another In

749 views • 55 slides
Quantum Causal Structures Christian Majenz University of Copenhagen Joint work with Rafael

Quantum Causal Structures Christian Majenz University of Copenhagen Joint work with Rafael

Quantum Causal Structures Christian Majenz University of Copenhagen Joint work with Rafael Chaves and David Gross, University of Freiburg (arXiv:1407.3800) 04.12.2014 Motivation Question Question Can we rule out certain causal relationships

1.51k views • 131 slides
CSCI 350 Ch. 5 Synchronization Mark Redekopp Michael Shindler & Ramesh Govindan 2 RACE

CSCI 350 Ch. 5 Synchronization Mark Redekopp Michael Shindler & Ramesh Govindan 2 RACE

1 CSCI 350 Ch. 5 Synchronization Mark Redekopp Michael Shindler & Ramesh Govindan 2 RACE CONDITIONS AND ATOMIC OPERATIONS 3 Race Condition A race condition occurs when the behavior of the program depends on the interleaving of

781 views • 49 slides
Jon Weissman Administrivia Greetings Welcome to CSci 5103! me: Jon Weissman, Professor CS

Jon Weissman Administrivia Greetings Welcome to CSci 5103! me: Jon Weissman, Professor CS

CSci 5103 Operating Systems Jon Weissman Administrivia Greetings Welcome to CSci 5103! me: Jon Weissman, Professor CS office hours M 9-11am, 4-225F KH or when I am around interests: distributed and parallel systems

487 views • 34 slides
Making Byzantine Fault Tolerant Systems Tolerate Byzantine Failures Allen Clement, Mirco

Making Byzantine Fault Tolerant Systems Tolerate Byzantine Failures Allen Clement, Mirco

Making Byzantine Fault Tolerant Systems Tolerate Byzantine Failures Allen Clement, Mirco Marchetti, Edmund Wong Lorenzo Alvisi, Mike Dahlin BFT Systems PBFT [OSDI 98] Attested Append Only Memory [SOSP 07] HQ [OSDI 06] Beyond 1/3 Faulty in

655 views • 64 slides

More recommend