Академический Документы
Профессиональный Документы
Культура Документы
Example 1: The following picture is a graph. List its vertices and edges. A D
C
E B
Example 2:
This is also a graph. The vertices just happen to have peoples names. Such a graph could represent friendships (or any kind of relationship).
Flexo
Bender
Leela Zoidberg
QuickTime and a TIFF (LZW) decompresso r are neede d to see this picture.
Qui ckTi me and a TIFF (LZW) decompressor are nee ded to se e th is p icture .
Fry
Amy
Farnsworth
Now check out the graph below. What can we say about it in comparison to the previous figure?
Leela
Fry Flexo
Amy
Bender Farnsworth
Qui ckTi me and a TIFF (LZW) decompressor are nee ded to se e th is p icture .
Zoidberg
QuickTime and a TIFF (LZW) decompresso r are neede d to see this picture.
Graph Terminology
Graph Terminology
Graph Terminology
Graph Terminology
Graph Terminology
Graph Terminology
Example 4: 1) Find a path from B to K passing through W but not S. B H K W 2) Find a path from H to J of length 4. 3) Find a circuit of length 5. 4) Find a circuit of length 1. 5) Find a bridge. Example 5: Draw a picture of a graph that satisfies the following: Vertices: A, B, C, D Edges: AB, AC, AD, B is adjacent to D.
Graph Terminology
Example 6: The graph on the left has no Euler paths, but the one on the right has several.
R R
Knigsbergs Bridges II
(The rare sequel that is not entirely gratuitous.)
Recall from Tuesday the puzzle that the residents of Knigsburg had been unable to solve until Eulers arrival: Is there a way to cross all seven bridges exactly once and return to your starting point? Is there even a way to cross all seven bridges exactly once?
What Euler realized was that most of the information on the maps had no impact on the answers to the two questions.
R R
By thinking of each bank and island as a vertex and each bridge as an edge joining them Euler was able to model the situation using the graph on the right. Hence, the Knigsberg puzzle is the same as asking if the graph has an Euler path or Euler circuit.
Example: The Scooby Gang needs to patrol the following section of town starting at
Sunnydale High (labeled G). Draw a graph that models this situation, assuming that each side of the street must be checked except for those along the park. (Map is from p. 206)
Slay-age
Example 2: (Exercise 21, pg 207) The map to the right of downtown Kingsburg, shows the Kings River running through the downtown area and the three islands (A, B, and C) connected to each other and both banks by seven bridges. The Chamber of Commerce wants to design a walking tour that crosses all the bridges. Draw a graph that models the layout of Kingsburg.
Example 3:
The Kevin Bacon Game
(http://www.cs.virginia.edu/oracle/)
Eulers Theorems
Eulers Theorem 1 (a) If a graph has any odd vertices, then it cannot have an Euler circuit. (b) If a graph is connected and every vertex is even, then it has at least one Euler circuit.
Eulers Theorem 2 (a) If a graph has more than two odd vertices, then it cannot have an Euler path. (b) If a connected graph has exactly two odd vertices then it has at least one Euler path starting at one odd vertex and ending at another odd vertex.
We have already seen that the puzzle boils down to whether this graph has an Euler path and/or an Euler circuit. Does this graph have either?
Example 5: (Exercise 60, pg 214) Refer to Example 2. Is it possible to take a walk such that you cross each bridge exactly once? Explain why or why not.
N
Example 6: Unicursal Tracings Recall the routing problems presented on Tuesday: Do these drawings have unicursal tracings? If so, are they open or closed?
How might we answer these queries? Well, if we add vertices to the corners of the tracings we can reduce the questions to asking whether the following graphs have Euler paths (open tracing) and/or Euler circuits (closed tracing).
(a)
(b)
(c)
Eulers Theorem 3 (a) The sum of the degrees of all the vertices of a graph equals twice the number of edges. (b) A graph always has an even number of odd vertices.
A quick summary . . .
Number of odd vertices Conclusion
0
2
4, 6, 8, . . .
1, 3, 5, . . .
Eulers Theorems give us a simple way to see whether an Euler circuit or an Euler path exists in a given graph, but how do we find the actual circuit or path? We could use a guess-and-check method, but for a large graph this could lead to many wasted hours--and not wasted in a particularly fun way!
Algorithms
An algorithm is a set of procedures/rules that, when followed, will always lead to a solution* to a given problem. Some algorithms are formula driven--they arrive at answers by taking data and plugging-in to some equation or function. Other algorithms are directive driven--they arrive at answers by following a given set of directions.
Fleurys Algorithm
The Idea: Dont burn your bridges behind you.
(bridges: graph-theory bridges, not real world)
When trying to find an Euler path or an Euler circuit, bridges are the last edges we should travel. Subtle point: Once we have traversed an edge we no longer care about it--so by bridges we mean the bridges of the part of the graph that we havent traveled yet.
Example 1: Does this graph have an Euler circuit? If so, find one.
A B D C E
Fleurys Algorithm
1) Ensure the graph is connected and all the vertices are even*. 2) Pick any vertex as the starting point. 3) When you have a choice, always travel along an edge that is not a bridge of the yetto-be-traveled part of the graph. 4) Label the edges in the order which you travel. 5) When you cant travel anymore, stop.
* - This works when we have an Euler circuit. If we only have a path, we must start at one of (two) the odd vertices.
Example 2: Do the following drawings have unicursal tracings? If so, label the edges 1, 2, 3, . . . In the order in which they can be traced.
Example 3: (Exercise 60, pg 214) The map to the right of downtown Kingsburg, shows the Kings River running through the downtown area and the three islands (A, B, and C) connected to each other and both banks by seven bridges. The Chamber of Commerce wants to design a walking tour that crosses all the bridges. Draw a graph that models the layout of Kingsburg.
It was shown yesterday that it was possible to take a walk in such that you cross each bridge exactly once. Show how. A
Example: The Scooby Gang needs to patrol the following section of town starting at
Sunnydale High (labeled G). Suppose that they must check each side of the street except for those along the park. Find an optimal route for our intrepid demon hunters to take.
Slay-age
Quiz 1, problem 2
B A C
Fibonacci Numbers
The Fibonacci Numbers are those that comprise the sequence: 1, 1, 2, 3, 5, 8, 13, 21, . . . The sequence can be defined by: F1=1, F2=1; Fn=Fn-1+Fn-2 These numbers can be used to draw a series of golden rectangles like those to the right.
Fibonacci Numbers
The sequence of Fibonacci Ratios fractions like 3/5, 5/8, 8/13 approach a number called the Golden Ratio (0.61803398)
Approx. = 0.618 x H
Approx. = 0.618 x H
.618 x Ht.
0.618 x Width