CS 2110 Lecture Notes - Lecture 18: Directed Acyclic Graph, List Of Algorithms, Topological Sorting
14 Jun 2017
School
Department
Course
Professor
Document Summary
Lecture 18 - graphs: we are not talking about graphs like bar graphs, circle graphs, we are talking about shit like the brain, like correspondence between people. This is a spring 2017 thing for you future readers. Graphical models that can recogniz a face through pixels and shit. Don"t worry bout it right now bro: directed graph. A directed graph is a pair (v, e), where. E is a set of ordered pairs (u, v) where u, v are in v. Element of v is called a vertex or node. Element of e is called an edge or arc. |v| is size of v: undirected graph. Like a directed graph but no arrows, just lines connecting stuff. Can easily be converted to a directed graph by turning each line to an arrow in both directions: graph terminology. Vertices u and v are called the source and sink. Two vertices are adjacent if they are connected by an edge.
