Day 24 mat385

• Announcements
  • You have an exam coming up Friday!

  • Your homework for 4.1 is due today.

  • There is a homework assignment for 5.1 on the schedule:

    Section 5.1: pp. 423--, #1, 2, 5, 13, 14, 18, 22, 26, 39, 42, 50, 56, 61

    Let's make that due on Wednesday of next week.

  • Notice that there are a whole bunch of links on today's page: have you noticed those before?;) I hope that they help.

• What questions do you have from chapters 2.2, 2.4, 2.5, 2.6, 3.1, 4.1?

• Let's finish with section 5.1: Graphs

• Let's start section 5.2: Trees and their representations

Links:

• Graph Terminology Handout
• Adjacency matrix example (directed)
• Tree Terminology Handout
• Tree Traversal

• Reverse Polish Notation
• No need to restrict Euler's formula to simple graphs! If you find a theorem with restrictions, ask yourself why the restrictions are there! (Now: is connectedness important?)
• Graph Isomorphism (and planar)
• Complete Graphs

• NIST (the National Institute of Standards and Technology) defines a tree as "A connected, undirected, acyclic graph". Our book does not require the "undirected" part, and many sources assume that a tree is directed! This does, unfortunately, add to the confusion.... An ordered tree is one where the children are numbered (there is a left to right), which is important for tree traversal.

• NIST (the National Institute of Standards and Technology) Dictionary of Algorithms and Data Structures