CSC190H1 Lecture Notes - Lecture 10: Prims, Biconnected Component, Mathematical Object
Document Summary
Graphs are a adt for the representation of general relationships. We discussed trees, initially, as a mechanism to represent hierarchical relationships. The graph is a generalization of the tree in which we can handle the gamut of general hierarchical, non-hierarchical, etc. , relationships. So far in the course, except with the discussion on general trees (as mentioned above), our data structures have all pertained to storage mechanisms for data. The general tree and now the graph are not mere storage mechanisms, but rather mechanisms to represent structure information -- enabling us (or rather, our computers) to "automatically reason" about that structure. A graph, g, can be expressed as a pair of two sets g=(v,e). V is the set of vertices of the graph: i. e. , the nodes of the graph. E is the set of edges of the graph: i. e. , the lines that connect nodes to indicate their relationship.
