 |
Graphs
and Algorithms on Graphs |
| CSC
220 |
Topic
-
Intuitive definitions of nodes, edges, graphs, paths, and
loops.
-
Types of Graphs -- simple, directed, weighted (also called
networks).
-
Connected and disconnected simple graphs
-
Strongly and weakly connected directed graphs
-
Adjacency matrix and edge list representations of graphs
-
Warshall's and Floyd's algorithms and their efficiency.
-
Dijkstra's Algorithm (also called the Greedy Algorithm) and
its efficiency.
Readings
Chapter 19, the entire chapter. This is an important
chapter. (We will cover 19.6 and 19.7 in the next topic)
