Differences

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

--- courses:cs211:winter2012:journals:garrett:entries:week_3 [2012/02/01 04:35] – section 3.1-3.3 garrettheath4
+++ courses:cs211:winter2012:journals:garrett:entries:week_3 [2012/03/07 03:44] (current) – added spacing garrettheath4
@@ Line 15: / Line 15: @@
 === 3.4: Testing Bipartiteness: An Application of Breadth-First Search ===
+:!: //Section 3.4 is a short section that talks about a specific use of the breadth-first search algorithm that checks a graph to determine if it is **bipartite**, meaning that the nodes can be organized into two distinct sets in which no two nodes within each set are connected by an edge.  I do not think it is necessary to include a summary on a section that is short in addition to being superfluous.//
-=== 3.5: Connectivity in Directed Graphs ===
-=== 3.6: Directed Acyclic Graphs and Topological Ordering ===
 ~~DISCUSSION~~