1 / 13

Directed Graphs

Directed Graphs. AZ Standard 2.4.1 Use directed graphs to solve problems. Edge. Node or Vertex. What is a directed graph?. A graph whose edges have directions. Arrows on the edges give directional information. In the example to the right you can move from A to B but not B to A.

millie
Download Presentation

Directed Graphs

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Directed Graphs AZ Standard 2.4.1 Use directed graphs to solve problems.

  2. Edge Node or Vertex What is a directed graph? • A graph whose edges have directions. • Arrows on the edges give directional information. • In the example to the right you can move from A to B but not B to A. • Can you name two other allowed moves?

  3. Why do we use directed graphs? • We use this type of graph to help represent problems and then solve them. • For example: UPS needs to establish the most efficient delivery routes possible. • Why would they want to do this?

  4. Using Directed Graphs to Solve Problems Connolly’s softball team is playing in a round-robin tournament, where every TD3 middle school plays every other school.Given the information on the next slide, rank the teams from 1st to last place.

  5. Using Directed Graphs to Solve Problems Fees beats Connolly and McKemy, Connolly beats Gililland, McKemy beats Connolly and Gililland, And Gililland beats Fees. Rank the teams from 1st to last place. Next slide- how to make a directed graph to solve this problem.

  6. Fees beats Connolly and McKemy, Connolly beats Gililland, McKemy beats Connolly and Gililland, And Gililland beats Fees. Rank the teams from 1st to last place. Fees Connolly Gililland McKemy Make a Directed Graph Draw & label four nodes to represent the teams.

  7. Fees beats Connolly and McKemy, Connolly beats Gililland, McKemy beats Connolly and Gililland, And Gililland beats Fees. Rank the teams from 1st to last place. Fees Connolly Gililland McKemy Make a Directed Graph Draw lines & arrows between teams that played games. Arrows point to losing team.

  8. Fees beats Connolly and McKemy, Connolly beats Gililland, McKemy beats Connolly and Gililland, And Gililland beats Fees. Rank the teams from 1st to last place. Fees Connolly Gililland McKemy Make a Directed Graph Draw lines & arrows between teams that played games. Arrows point to losing team.

  9. Fees beats Connolly and McKemy, Connolly beats Gililland, McKemy beats Connolly and Gililland, And Gililland beats Fees. Rank the teams from 1st to last place. Fees Connolly Gililland McKemy Make a Directed Graph Draw lines & arrows between teams that played games. Arrows point to losing team.

  10. Fees beats Connolly and McKemy, Connolly beats Gililland, McKemy beats Connolly and Gililland, And Gililland beats Fees. Rank the teams from 1st to last place. Fees Connolly Gililland McKemy Make a Directed Graph Draw lines & arrows between teams that played games. Arrows point to losing team.

  11. Rank the teams from 1st to last place. -notice that each team played 3 games (count lines leaving each vertex) -Fees - 2 wins -Connollly - 1 win -Gilliland - 1 win -McKemy - 2 wins Fees Connolly Gililland McKemy Make a Directed Graph Fees & McKemy must play 1 more game to decide winner.

  12. A Hamilton Path travels from vertex (node) to vertex (node) JUST ONCE. List all Hamilton Paths in the directed graph on this slide. A C B Directed Graph and Hamilton Paths

  13. A Hamilton Path travels from vertex (node) to vertex (node) JUST ONCE. List all Hamilton Paths in the directed graph on this slide. A C B Directed Graph and Hamilton Paths Answers: A - B - C; B - C - A; C - A - B

More Related