Lecture 25.
Yurai Nuñez gave the lecture today.
I like to distinguish edges between edges in a directed graph, or an undirected
graph by the use of different parentheses. For example a directed edge from u to
v is an ordered pair (u,v). On the other hand an edge u,v is simple a two
element subset {u,v}.
Yurai
went over terminology that is used in graph theory. Some of these terms are not
quite standard, although the terms that you saw coincide with or text book and
are very common. Sometimes a graph with no loops (an edge from a vertex to
itself) or multiple edges (that is more that one copy of the edge {u,v} in an
undirected graph, or (u,v) in the directed graph) is called a "simple graph".
All of the graphs considered in or book are simple, so the simple adjective is
dropped.
Yurai also talked
about graph representations. In particular the adjacency matrix, the incidence
matrix, and the linked structure called an adjacency
list.
I will continue with
graph algorithms for the rest of this week.
Posted: Mon - March 12, 2007 at 02:55 PM