Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
courses:cs211:winter2012:journals:ian:chapter3 [2012/02/01 00:35] sturdyicourses:cs211:winter2012:journals:ian:chapter3 [2012/02/01 03:11] (current) sturdyi
Line 4: Line 4:
  
    * A graph is a connection of nodes and edges, which may be either directed or undirected; this can model a variety of complexes and relationships, especially networks (whether physical or notional); trees are graphs that do not contain cycles. A typical operation on a graph is traversal between nodes along edges, and more generally the search for possible and optimal traversals.    * A graph is a connection of nodes and edges, which may be either directed or undirected; this can model a variety of complexes and relationships, especially networks (whether physical or notional); trees are graphs that do not contain cycles. A typical operation on a graph is traversal between nodes along edges, and more generally the search for possible and optimal traversals.
-   No insights.+   I would have liked to see some examples of graphs representing things other than networks, like the prior example of phrasing stable matching as a graph-solving problem. They gave a lot of examples, but all fell into two or three sets up to isomorphism.
    * No questions.    * No questions.
-   Meh. 7/10.+   No other complaints. 7/10.
  
 ===== 3.2 Graph Connectivity and Traversal ===== ===== 3.2 Graph Connectivity and Traversal =====
  
-   * Two common patterns to algorithms answering questions about graphs are breadth-first and depth-first search; the former is particularly useful for finding shortest roots and analyzing cycles, and the latter where backtracking is easier than arbitrary jumping; both are suited to finding connected components.+   * Two common patterns to algorithms answering questions about graphs are breadth-first and depth-first search; the former is particularly useful for finding shortest roots and analyzing cycles, and the latter where backtracking is easier than arbitrary jumping; both are suited to finding connected components. In BFS two nodes sharing an edge must be in the same layer or subsequent layers; in DFS if {//a//,//b//} is an edge either //a// is an ancestor of //b// or vice versa.
    * No insights.    * No insights.
    * No questions.    * No questions.
-   Meh. 7/10.+   No complaints.. 7/10.
  
 ===== 3.3 Implementing Graph Traversal Using Queues and Stacks ===== ===== 3.3 Implementing Graph Traversal Using Queues and Stacks =====
courses/cs211/winter2012/journals/ian/chapter3.1328056515.txt.gz · Last modified: 2012/02/01 00:35 by sturdyi
CC Attribution-Noncommercial-Share Alike 4.0 International
Driven by DokuWiki Recent changes RSS feed Valid CSS Valid XHTML 1.0