CS 225 Lecture Notes - Lecture 38: Hash Table, Spanning Tree, Asteroid Family

68 views5 pages

Document Summary

Need: common vocabulary, graph implementation, traversal, algorithms. Last two algorithms will be overrepresented on final. Cs 374 picks up about graphs really well and algorithms. When we try to represent a model, it"s generally a type of implementation of a graph. Standford bunny, used in graphics and computation geometry when applied on a static object. Taking the pointers in a scanner and put it in a computer. Kepted pointers that had high curvature and connecting vertices with triangles to create a 3d model of a rabbit. Path(g_2) - sequence of vertices connected by edges. Cycle(g_1) - path with common begin and end vertex. Simple graph(g) - graph with no self loops and no multi-edges. |e| = m subgraph(g) - g" = (v", e"), v"_v, e"_e, and (u,v)_e" implies u_v" and v_v" complete subtraph(g_2) - connected subtraph(g) - connected component(g) - Graphs: theory that will help us in analysis.

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers
Class+
$8 USD/m
Billed $96 USD annually
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
30 Verified Answers

Related Documents