Learning Outcome

At the end of this topic, students should be able to:

Understand Bellman–Ford Algorithm and the Distance Vector Approach.

Understand Dijkstra's Algorithm.

Understand the Comparison of the Bellman–Ford Algorithm and Dijkstra's Algorithm.

Be familiar with Shortest Path Computation with Candidate Path Caching.

Be familiar with Widest Path Computation with Candidate Path Caching.

Understand the Widest Path Algorithm.

Understand the K-Shortest Paths Algorithm.

Learning Outcome

Identify all of the rendering primitives available in OpenGL.

Initialize and populate data buffers for use in rendering geometry.

Be familiar with different OpenGL techniques.

Develop some elementary graphics tools for drawing lines, polylines, and polygons.

Implement various graphics primitives.

Develop tools that allow the user to control a program with the mouse and keyboard.