SlideShare une entreprise Scribd logo
1  sur  13
The Seven Bridges
  of Konigsberg

              QuickTime™ and a
            H.264 decompressor
      are needed to see this picture.
It is now called Kaliningrad




Can you see the seven bridges?
The people wondered whether or not one could walk around the city in a way that
would involve crossing each bridge exactly once.
Problem 1
Try it. Sketch the above map of the city on a sheet of paper and try to 'plan your
journey' with a pencil in such a way that you trace over each bridge once and only once
and you complete the 'plan' with one continuous pencil stroke
Can’t do it - neither could Euler - a very famous mathematician. In fact he proved
that it couldn’t be done.
Leonhard Euler




                    QuickTime™ and a
                      decompressor
            are needed to see this picture.
Problem 2
Suppose they had decided to build one fewer bridge in Konigsberg, so
that the map looked like this:




   Now try and solve the problem
Problem 3
Does it matter which bridge you take away? What if you
add bridges? Come up with some maps on your own, and
try to 'plan your journey' for each one




           Can you draw any conclusions?
These are the same
     Diagram
Node
                                    (Vertice)
      Edge
      (Arc)

A network is a figure made up of nodes and edges

 A node is ODD if it has an odd number of edges
     leading into it otherwise it is called even

 An Euler path is a continuous path that passes
through each arc once and only once - we say the
            network is transversable
Euler proved:

If a network has more than two odd vertices,
it does not have an Euler path i.e it is not
transversable

He also proved:
If a network has two or zero odd vertices, it
has at least one Euler path. In particular, if a
network has exactly two odd vertices, then
its Euler path can only start on one of the
odd vertices

        Why is this important..... Circuits?
This branch of Mathematics is called Graph Theory

    or more specifically topological graph theory


Very useful for proving the “Hairy Ball Theorem”



                           QuickTime™ and a
                             decompressor
                   are needed to see this picture.
Just to alter your perception of reality a bit...




                          QuickTime™ and a
                            decompressor
                  are needed to see this picture.

Contenu connexe

Tendances

Applications of graph theory
                      Applications of graph theory                      Applications of graph theory
Applications of graph theoryNilaNila16
 
Dijkstra's algorithm presentation
Dijkstra's algorithm presentationDijkstra's algorithm presentation
Dijkstra's algorithm presentationSubid Biswas
 
Graph theory introduction - Samy
Graph theory  introduction - SamyGraph theory  introduction - Samy
Graph theory introduction - SamyMark Arokiasamy
 
Graphs In Data Structure
Graphs In Data StructureGraphs In Data Structure
Graphs In Data StructureAnuj Modi
 
Slides Chapter10.1 10.2
Slides Chapter10.1 10.2Slides Chapter10.1 10.2
Slides Chapter10.1 10.2showslidedump
 
Graph traversal-BFS & DFS
Graph traversal-BFS & DFSGraph traversal-BFS & DFS
Graph traversal-BFS & DFSRajandeep Gill
 
Dijkstra’S Algorithm
Dijkstra’S AlgorithmDijkstra’S Algorithm
Dijkstra’S Algorithmami_01
 
Application Of Graph Data Structure
Application Of Graph Data StructureApplication Of Graph Data Structure
Application Of Graph Data StructureGaurang Dobariya
 
Graph theory concepts complex networks presents-rouhollah nabati
Graph theory concepts   complex networks presents-rouhollah nabatiGraph theory concepts   complex networks presents-rouhollah nabati
Graph theory concepts complex networks presents-rouhollah nabatinabati
 
Dijkstra algorithm a dynammic programming approach
Dijkstra algorithm   a dynammic programming approachDijkstra algorithm   a dynammic programming approach
Dijkstra algorithm a dynammic programming approachAkash Sethiya
 
Introduction to Graph Theory
Introduction to Graph TheoryIntroduction to Graph Theory
Introduction to Graph Theory Kazi Md. Saidul
 

Tendances (20)

Applications of graph theory
                      Applications of graph theory                      Applications of graph theory
Applications of graph theory
 
Dijkstra's algorithm presentation
Dijkstra's algorithm presentationDijkstra's algorithm presentation
Dijkstra's algorithm presentation
 
Graph theory introduction - Samy
Graph theory  introduction - SamyGraph theory  introduction - Samy
Graph theory introduction - Samy
 
graph theory
graph theory graph theory
graph theory
 
dijkstra algo.ppt
dijkstra algo.pptdijkstra algo.ppt
dijkstra algo.ppt
 
Graph theory
Graph theory Graph theory
Graph theory
 
Graphs In Data Structure
Graphs In Data StructureGraphs In Data Structure
Graphs In Data Structure
 
Slides Chapter10.1 10.2
Slides Chapter10.1 10.2Slides Chapter10.1 10.2
Slides Chapter10.1 10.2
 
Graph traversal-BFS & DFS
Graph traversal-BFS & DFSGraph traversal-BFS & DFS
Graph traversal-BFS & DFS
 
Dijkstra’S Algorithm
Dijkstra’S AlgorithmDijkstra’S Algorithm
Dijkstra’S Algorithm
 
Graph Theory
Graph TheoryGraph Theory
Graph Theory
 
Application Of Graph Data Structure
Application Of Graph Data StructureApplication Of Graph Data Structure
Application Of Graph Data Structure
 
Loops
LoopsLoops
Loops
 
Graph theory concepts complex networks presents-rouhollah nabati
Graph theory concepts   complex networks presents-rouhollah nabatiGraph theory concepts   complex networks presents-rouhollah nabati
Graph theory concepts complex networks presents-rouhollah nabati
 
Dijkstra algorithm a dynammic programming approach
Dijkstra algorithm   a dynammic programming approachDijkstra algorithm   a dynammic programming approach
Dijkstra algorithm a dynammic programming approach
 
MATCHING GRAPH THEORY
MATCHING GRAPH THEORYMATCHING GRAPH THEORY
MATCHING GRAPH THEORY
 
Graphs bfs dfs
Graphs bfs dfsGraphs bfs dfs
Graphs bfs dfs
 
Introduction to Graph Theory
Introduction to Graph TheoryIntroduction to Graph Theory
Introduction to Graph Theory
 
Graphs - Discrete Math
Graphs - Discrete MathGraphs - Discrete Math
Graphs - Discrete Math
 
Bfs and Dfs
Bfs and DfsBfs and Dfs
Bfs and Dfs
 

Similaire à Koinsburg bridge

Graph-Theory-and-Management-Science-2-Fleurys-Algorithm-and-Eulerizing.pptx
Graph-Theory-and-Management-Science-2-Fleurys-Algorithm-and-Eulerizing.pptxGraph-Theory-and-Management-Science-2-Fleurys-Algorithm-and-Eulerizing.pptx
Graph-Theory-and-Management-Science-2-Fleurys-Algorithm-and-Eulerizing.pptxMuhammadMuqrrab1
 
Euleria
EuleriaEuleria
Eulerianarca
 
koningsbergproblem-140215072342-phpapp02 (1).pptx
koningsbergproblem-140215072342-phpapp02 (1).pptxkoningsbergproblem-140215072342-phpapp02 (1).pptx
koningsbergproblem-140215072342-phpapp02 (1).pptxAlpa Rajput
 
Distruct week 15 graphs theory (updated)
Distruct week 15 graphs theory (updated)Distruct week 15 graphs theory (updated)
Distruct week 15 graphs theory (updated)Robert Almazan
 
distructweek15graphstheoryupdated-160227143444.pdf
distructweek15graphstheoryupdated-160227143444.pdfdistructweek15graphstheoryupdated-160227143444.pdf
distructweek15graphstheoryupdated-160227143444.pdfansariparveen06
 
Fleurys abas abbasli_
Fleurys abas  abbasli_Fleurys abas  abbasli_
Fleurys abas abbasli_abas1333
 
Graph theory
Graph theoryGraph theory
Graph theoryTech_MX
 
Stitching Graphs and Painting Mazes: Problems in Generalizations of Eulerian ...
Stitching Graphs and Painting Mazes: Problems in Generalizations of Eulerian ...Stitching Graphs and Painting Mazes: Problems in Generalizations of Eulerian ...
Stitching Graphs and Painting Mazes: Problems in Generalizations of Eulerian ...Joshua Holden
 
Graph theory 1
Graph theory 1Graph theory 1
Graph theory 1Tech_MX
 
Lecture 16 - Dijkstra's Algorithm.pdf
Lecture 16 - Dijkstra's Algorithm.pdfLecture 16 - Dijkstra's Algorithm.pdf
Lecture 16 - Dijkstra's Algorithm.pdfiftakhar8
 
Fractals, Geometry of Nature and Logistic Model
Fractals, Geometry of Nature and Logistic ModelFractals, Geometry of Nature and Logistic Model
Fractals, Geometry of Nature and Logistic ModelOsman Villanueva
 
Minimum spanning tree
Minimum spanning treeMinimum spanning tree
Minimum spanning treeSTEFFY D
 

Similaire à Koinsburg bridge (20)

Graph theory
Graph theoryGraph theory
Graph theory
 
Graph-Theory-and-Management-Science-2-Fleurys-Algorithm-and-Eulerizing.pptx
Graph-Theory-and-Management-Science-2-Fleurys-Algorithm-and-Eulerizing.pptxGraph-Theory-and-Management-Science-2-Fleurys-Algorithm-and-Eulerizing.pptx
Graph-Theory-and-Management-Science-2-Fleurys-Algorithm-and-Eulerizing.pptx
 
CST 504 Graphs
CST 504 GraphsCST 504 Graphs
CST 504 Graphs
 
Euleria
EuleriaEuleria
Euleria
 
koningsbergproblem-140215072342-phpapp02 (1).pptx
koningsbergproblem-140215072342-phpapp02 (1).pptxkoningsbergproblem-140215072342-phpapp02 (1).pptx
koningsbergproblem-140215072342-phpapp02 (1).pptx
 
L4-Logic.ppt
L4-Logic.pptL4-Logic.ppt
L4-Logic.ppt
 
Distruct week 15 graphs theory (updated)
Distruct week 15 graphs theory (updated)Distruct week 15 graphs theory (updated)
Distruct week 15 graphs theory (updated)
 
distructweek15graphstheoryupdated-160227143444.pdf
distructweek15graphstheoryupdated-160227143444.pdfdistructweek15graphstheoryupdated-160227143444.pdf
distructweek15graphstheoryupdated-160227143444.pdf
 
Fleurys abas abbasli_
Fleurys abas  abbasli_Fleurys abas  abbasli_
Fleurys abas abbasli_
 
Graph theory
Graph theoryGraph theory
Graph theory
 
Euler graph
Euler graphEuler graph
Euler graph
 
EG- Unit 1.pptx
EG- Unit 1.pptxEG- Unit 1.pptx
EG- Unit 1.pptx
 
Stitching Graphs and Painting Mazes: Problems in Generalizations of Eulerian ...
Stitching Graphs and Painting Mazes: Problems in Generalizations of Eulerian ...Stitching Graphs and Painting Mazes: Problems in Generalizations of Eulerian ...
Stitching Graphs and Painting Mazes: Problems in Generalizations of Eulerian ...
 
Graph theory 1
Graph theory 1Graph theory 1
Graph theory 1
 
Criticalthinking
CriticalthinkingCriticalthinking
Criticalthinking
 
Lecture 16 - Dijkstra's Algorithm.pdf
Lecture 16 - Dijkstra's Algorithm.pdfLecture 16 - Dijkstra's Algorithm.pdf
Lecture 16 - Dijkstra's Algorithm.pdf
 
Fractals, Geometry of Nature and Logistic Model
Fractals, Geometry of Nature and Logistic ModelFractals, Geometry of Nature and Logistic Model
Fractals, Geometry of Nature and Logistic Model
 
Fractals
FractalsFractals
Fractals
 
Slop Intercept Method
Slop Intercept MethodSlop Intercept Method
Slop Intercept Method
 
Minimum spanning tree
Minimum spanning treeMinimum spanning tree
Minimum spanning tree
 

Plus de Simon Borgert

Voic ed presentationPrBl
Voic ed presentationPrBlVoic ed presentationPrBl
Voic ed presentationPrBlSimon Borgert
 
Collaborative programming ppt
Collaborative programming pptCollaborative programming ppt
Collaborative programming pptSimon Borgert
 
General 2 HSC Credit and Borrowing - Future Value
General 2 HSC Credit and Borrowing - Future ValueGeneral 2 HSC Credit and Borrowing - Future Value
General 2 HSC Credit and Borrowing - Future ValueSimon Borgert
 
Country maths comes to the city
Country maths comes to the cityCountry maths comes to the city
Country maths comes to the citySimon Borgert
 
Term 2 2013 rich tasks etc
Term 2 2013 rich tasks etcTerm 2 2013 rich tasks etc
Term 2 2013 rich tasks etcSimon Borgert
 
Effective feedback with bonus rich tasks
Effective feedback with bonus rich tasksEffective feedback with bonus rich tasks
Effective feedback with bonus rich tasksSimon Borgert
 
Teach meet anywhere anytime learning
Teach meet anywhere anytime learningTeach meet anywhere anytime learning
Teach meet anywhere anytime learningSimon Borgert
 
Exponential growth and decay
Exponential growth and decayExponential growth and decay
Exponential growth and decaySimon Borgert
 
Topic 1 algebra lesson 1
Topic 1 algebra lesson 1Topic 1 algebra lesson 1
Topic 1 algebra lesson 1Simon Borgert
 
Trig products as sum and differecnes
Trig products as sum and differecnesTrig products as sum and differecnes
Trig products as sum and differecnesSimon Borgert
 
Using Facebook, Connect, Moodle and Youtube for Teaching Mathematics
Using Facebook, Connect, Moodle and Youtube for Teaching MathematicsUsing Facebook, Connect, Moodle and Youtube for Teaching Mathematics
Using Facebook, Connect, Moodle and Youtube for Teaching MathematicsSimon Borgert
 
Unit Circle - Trigonometry
Unit Circle - TrigonometryUnit Circle - Trigonometry
Unit Circle - TrigonometrySimon Borgert
 
Angle between 2 lines
Angle between 2 linesAngle between 2 lines
Angle between 2 linesSimon Borgert
 
Supporting the DER with Moodle
Supporting the DER with MoodleSupporting the DER with Moodle
Supporting the DER with MoodleSimon Borgert
 
Factorising quads diff 2 squares perfect squares
Factorising quads diff 2 squares perfect squaresFactorising quads diff 2 squares perfect squares
Factorising quads diff 2 squares perfect squaresSimon Borgert
 
Perms and combs lesson 1
Perms and combs lesson 1Perms and combs lesson 1
Perms and combs lesson 1Simon Borgert
 

Plus de Simon Borgert (20)

Voic ed presentationPrBl
Voic ed presentationPrBlVoic ed presentationPrBl
Voic ed presentationPrBl
 
Collaborative programming ppt
Collaborative programming pptCollaborative programming ppt
Collaborative programming ppt
 
General 2 HSC Credit and Borrowing - Future Value
General 2 HSC Credit and Borrowing - Future ValueGeneral 2 HSC Credit and Borrowing - Future Value
General 2 HSC Credit and Borrowing - Future Value
 
Country maths comes to the city
Country maths comes to the cityCountry maths comes to the city
Country maths comes to the city
 
Term 2 2013 rich tasks etc
Term 2 2013 rich tasks etcTerm 2 2013 rich tasks etc
Term 2 2013 rich tasks etc
 
Effective feedback with bonus rich tasks
Effective feedback with bonus rich tasksEffective feedback with bonus rich tasks
Effective feedback with bonus rich tasks
 
Teach meet anywhere anytime learning
Teach meet anywhere anytime learningTeach meet anywhere anytime learning
Teach meet anywhere anytime learning
 
Exponential growth and decay
Exponential growth and decayExponential growth and decay
Exponential growth and decay
 
Lesson 2 like terms
Lesson 2   like termsLesson 2   like terms
Lesson 2 like terms
 
Topic 1 algebra lesson 1
Topic 1 algebra lesson 1Topic 1 algebra lesson 1
Topic 1 algebra lesson 1
 
Trig products as sum and differecnes
Trig products as sum and differecnesTrig products as sum and differecnes
Trig products as sum and differecnes
 
Using Facebook, Connect, Moodle and Youtube for Teaching Mathematics
Using Facebook, Connect, Moodle and Youtube for Teaching MathematicsUsing Facebook, Connect, Moodle and Youtube for Teaching Mathematics
Using Facebook, Connect, Moodle and Youtube for Teaching Mathematics
 
Trig identities
Trig identitiesTrig identities
Trig identities
 
Special angles
Special anglesSpecial angles
Special angles
 
Unit Circle - Trigonometry
Unit Circle - TrigonometryUnit Circle - Trigonometry
Unit Circle - Trigonometry
 
Angle between 2 lines
Angle between 2 linesAngle between 2 lines
Angle between 2 lines
 
Supporting the DER with Moodle
Supporting the DER with MoodleSupporting the DER with Moodle
Supporting the DER with Moodle
 
DER Info night 2011
DER Info night 2011DER Info night 2011
DER Info night 2011
 
Factorising quads diff 2 squares perfect squares
Factorising quads diff 2 squares perfect squaresFactorising quads diff 2 squares perfect squares
Factorising quads diff 2 squares perfect squares
 
Perms and combs lesson 1
Perms and combs lesson 1Perms and combs lesson 1
Perms and combs lesson 1
 

Koinsburg bridge

  • 1. The Seven Bridges of Konigsberg QuickTime™ and a H.264 decompressor are needed to see this picture.
  • 2. It is now called Kaliningrad Can you see the seven bridges?
  • 3.
  • 4. The people wondered whether or not one could walk around the city in a way that would involve crossing each bridge exactly once. Problem 1 Try it. Sketch the above map of the city on a sheet of paper and try to 'plan your journey' with a pencil in such a way that you trace over each bridge once and only once and you complete the 'plan' with one continuous pencil stroke
  • 5. Can’t do it - neither could Euler - a very famous mathematician. In fact he proved that it couldn’t be done.
  • 6. Leonhard Euler QuickTime™ and a decompressor are needed to see this picture.
  • 7. Problem 2 Suppose they had decided to build one fewer bridge in Konigsberg, so that the map looked like this: Now try and solve the problem
  • 8. Problem 3 Does it matter which bridge you take away? What if you add bridges? Come up with some maps on your own, and try to 'plan your journey' for each one Can you draw any conclusions?
  • 9. These are the same Diagram
  • 10. Node (Vertice) Edge (Arc) A network is a figure made up of nodes and edges A node is ODD if it has an odd number of edges leading into it otherwise it is called even An Euler path is a continuous path that passes through each arc once and only once - we say the network is transversable
  • 11. Euler proved: If a network has more than two odd vertices, it does not have an Euler path i.e it is not transversable He also proved: If a network has two or zero odd vertices, it has at least one Euler path. In particular, if a network has exactly two odd vertices, then its Euler path can only start on one of the odd vertices Why is this important..... Circuits?
  • 12. This branch of Mathematics is called Graph Theory or more specifically topological graph theory Very useful for proving the “Hairy Ball Theorem” QuickTime™ and a decompressor are needed to see this picture.
  • 13. Just to alter your perception of reality a bit... QuickTime™ and a decompressor are needed to see this picture.