1 files changed, 122 insertions, 0 deletions
diff --git a/java/docs/algo/BreadthFirstSearch.html b/java/docs/algo/BreadthFirstSearch.html
new file mode 100644
index 0000000..47c782c
--- /dev/null
+++ b/java/docs/algo/BreadthFirstSearch.html
@@ -0,0 +1,122 @@
+<HTML
+><HEAD
+><TITLE
+></TITLE
+><META
+NAME="GENERATOR"
+CONTENT="Modular DocBook HTML Stylesheet Version 1.7"><LINK
+REL="NEXT"
+TITLE="Bibliography"
+HREF="bibliography.html"></HEAD
+><BODY
+CLASS="ARTICLE"
+BGCOLOR="#FFFFFF"
+TEXT="#000000"
+LINK="#0000FF"
+VLINK="#840084"
+ALINK="#0000FF"
+><DIV
+CLASS="ARTICLE"
+><DIV
+CLASS="SECT1"
+><H1
+CLASS="SECT1"
+><A
+NAME="JOELIB.ALGORITHMS.BREADTHFIRSTSEARCH"
+></A
+>Breadth First Search (BFS)</H1
+><P
+>&#13;The BFS method performs a breadth-first search  [<A
+HREF="bibliography.html#CLR98"
+>clr98</A
+>] of a graph.
+A breadth-first search visits vertices that are closer to the
+source before visiting vertices that are further away. In this
+context `distance' is defined as the number of edges in the
+shortest path from the source vertex.
+<DIV
+CLASS="FIGURE"
+><A
+NAME="JOELIB.ALGORITHMS.BREADTHFIRSTSEARCH.PSEUDOCODE"
+></A
+><P
+><B
+>Figure 1. Pseudocode for the BFS algorithm</B
+></P
+><PRE
+CLASS="PROGRAMLISTING"
+>paint all vertices white;
+paint the source grey, set its distance to 0 and enqueue it;
+repeat
+  dequeue vertex v;
+  if v is the target, we're done - exit this algorithm;
+  paint v black;
+  for each white neighbor w of v
+	paint w grey;
+	set distance w to (distance v + 1);
+	set parent w to v;
+	enqueue w
+until the queue is empty
+if we haven't yet exited, we didn't find the target</PRE
+></DIV
+>
+The time complexity is <IMG
+SRC="formulas/o_e+v.gif"> [<A
+HREF="bibliography.html#CLR98"
+>clr98</A
+>].</P
+></DIV
+></DIV
+><DIV
+CLASS="NAVFOOTER"
+><HR
+ALIGN="LEFT"
+WIDTH="100%"><TABLE
+SUMMARY="Footer navigation table"
+WIDTH="100%"
+BORDER="0"
+CELLPADDING="0"
+CELLSPACING="0"
+><TR
+><TD
+WIDTH="33%"
+ALIGN="left"
+VALIGN="top"
+>&nbsp;</TD
+><TD
+WIDTH="34%"
+ALIGN="center"
+VALIGN="top"
+>&nbsp;</TD
+><TD
+WIDTH="33%"
+ALIGN="right"
+VALIGN="top"
+><A
+HREF="bibliography.html"
+ACCESSKEY="N"
+>Next</A
+></TD
+></TR
+><TR
+><TD
+WIDTH="33%"
+ALIGN="left"
+VALIGN="top"
+>&nbsp;</TD
+><TD
+WIDTH="34%"
+ALIGN="center"
+VALIGN="top"
+>&nbsp;</TD
+><TD
+WIDTH="33%"
+ALIGN="right"
+VALIGN="top"
+>Bibliography</TD
+></TR
+></TABLE
+></DIV
+></BODY
+></HTML
+>
+\ No newline at end of file