Section outline



  • EULER PATHS, HAMILTON PATHS, SHORTEST PATH PROBLEMS


    LESSON OBJECTIVE

    Lesson 21

    • In this lesson, a discussion on Euler path, Hamilton path and shortest path problems will be introduced

    Lesson 22

    • In this lesson, a discussion on Euler path, Hamilton path and shortest path problems will be continued


    LEARNING OUTCOME

    • Able to understand the Euler graph, Euler path and Euler circuit/cycle
    • Able to identify Euler graph 
    • Able to understand the Hamilton graph, Hamilton path and Hamilton circuit/cycle
    • Able to identify Hamilton graph
    • Able to understand shortest path problems
    • Able to apply Dijkstra's Algorithm and Floyd's Algorithm
    DISCUSSION TOPICS

    • Basic concept of Euler Graph and Hamilton Graph.
    • Finding Euler path and circuit as well as Hamilton path and circuit.
    • Basic concept of shortest path problems.
    • Applying Dijkstra's algorithm and Floyd's algorithm.


    LECTURE VIDEO