[[courses:cs211:winter2012:journals:garrett:entries:week_3]]
Trace:
Show page
AdminRecent ChangesSitemap

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:garrett:entries:week_3 [2012/02/01 16:36] – moved 3.5-3.6 to week 4 garrettheath4courses:cs211:winter2012:journals:garrett:entries:week_3 [2012/03/07 03:44] (current) – added spacing garrettheath4
Line 16: Line 16:
 === 3.4: Testing Bipartiteness: An Application of Breadth-First Search === === 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.// :!: //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.//
 +
 +
  
 ~~DISCUSSION~~ ~~DISCUSSION~~
courses/cs211/winter2012/journals/garrett/entries/week_3.1328114190.txt.gz · Last modified: 2012/02/01 16:36 by garrettheath4
Show pageOld revisions
Media ManagerBack to top
CC Attribution-Noncommercial-Share Alike 4.0 International
Driven by DokuWiki Recent changes RSS feed Valid CSS Valid XHTML 1.0