CSCA67H3 Lecture Notes - Lecture 3: Cluster Analysis, If And Only If, Pregolya River
6
CSCA67H3 Full Course Notes
Verified Note
6 documents
Document Summary
Bridges of k onigsberg question about the river pregel in the city of k onigsberg where he lived in prussia. The town had seven bridges crossing the river. Is it possible to walk a route that crosses all seven bridges exactly once and ends up at the same starting point? . He solved the problem by representing each section of land by a node and drawing lines or edges between them for each bridge. Graph theory de nitions: a graph g = (v, e) consists of a set of vertices (or nodes) Undirected graph directed graph a directed graph is said to be strongly connected if, for any two vertices u, v, there is a directed path from u to v. Strongly connectednot strongly connectednot connectedconnectedapplications of graphs: www-google, scheduling, chip design, network analysis, such as transportation ow, cellular cov- erage, electrical current etc, flow charts, explanatory schematics, bioinformatics - data clustering, etc.
