Computer Science 331 — Graphs and Graph Algorithms

Tube Map

Graphs and Graph Algorithms

Overview

In mathematics, graphs are mathematical structures used to model pairwise relationships between objects. These have many applications — they can be used to model many types of relations and processes in physical, biological, social and information systems. Thus graph problems and algorithms are widely studied and used.

The final part of the course includes an introduction to graph algorithms and problems. It leads nicely into a future course that computer science majors will take — CPSC 413 — because it includes another kind of algorithm — a greedy algorithm — that will be studied in that course.

Lecture #19: Introduction to Graphs

Required Reading

Lecture Presentation

Tutorial #18: Graphs and Their Representations

Lecture #20: Graph Search

Required Reading

Lecture Presentation

Tutorial #19: Graph Search

Lecture #21: Computation of Minimum-Cost Paths — Dijkstra’s Algorithm

Required Reading

Lecture Presentation

Tutorial #20: Computation of Minimum-Cost Paths

Lecture #22: Computation of Minimmum-Cost Spanning Trees — Prim’s Algorithm

Required Reading

Lecture Presentation

Tutorial #21: Computation of Minimum-Cost Spanning Trees

Lecture #23: Network Flow

Required Reading

Lecture Presentation

Tutorial #22: Network Flow


University of Calgary Extension of Logo
Department of Computer Science

cpsc 331 computer science faculty of science u of c

cpsc 331 intro and math review analysis of algorithms basic data structures and adts search trees hash tables searching and sorting graph algorithms java develoment exercises assignments tests