INB221 Lecture Notes - Linked List, Adjacency Matrix, Backtracking
4 Jul 2013
School
Department
Course
Professor
Document Summary
Graphs are important in cs cause they can represent any relationship. The key to solving problems is to think of them in terms of graphs, e. g. a gps, showing you a graph of point a to point b. There are lots of algorithms to solve these sorts of problems, such as the shortest path algorithm by djikstra and the. Euler"s solution to the konigsberg bridge problem brought about graph theory, an entire new branch of mathematics. He did this by removing all physical properties of the problem, leaving just the nodes and bridges. When we have more than one pair between two nodes, it"s called a parralell edge". If a node has an edge that connects to itself it"s called a loop". A sequence of edges that connects two nodes is called a path. Paths can be designated by the paths it crosses (wxyz), or bcdac ( the vertices it passes through).
