boost/graph/cuthill_mckee_ordering.hpp, boost/graph/king_ordering.hpp:

- Remove use of connected components, so we need only one color map
    running around
  - Provide simple overloads, requiring only the graph and the output iterator.

boost/graph/detail/sparse_ordering.hpp:
  - Move out_degree_property_map here

boost/graph/fruchterman_reingold.hpp:
  - Fix enumeration of pairs in grid_force_pairs to repulse vertices in
    adjacent grid cells (in addition to the current cell), so we don't get
    vertices forming crosses on grid lines.
  - Round up the number of rows/columns.

libs/graph/doc/cuthill_mckee_ordering.html, libs/graph/doc/king_ordering.html:
  - Document new overloads

libs/graph/doc/gursoy_atun_layout.html:
  - Add missing semicolon

libs/graph/src/python/cuthill_mckee_ordering.cpp,
libs/graph/test/cuthill_mckee_ordering.cpp:
  - Test and use the new overloads

libs/graph/build/python/Jamfile, libs/graph/src/python/module.cpp,
libs/graph/src/python/king_ordering.cpp:
  - Support King's ordering algorithm from Python

libs/graph/example/python/vis.py:
  - By default, do a "progressive" Fruchterman-Reingold layout

libs/graph/test/king_ordering.cpp:
  - Test new overload


[SVN r28306]

example/python/vis.py

@@ -681,7 +681,8 @@ class GraphEditorWindow(wx.Frame):
     def FruchtermanReingoldLayout(self, event):
         bgl.fruchterman_reingold_force_directed_layout(self.canvas.graph, 
                                                        self.canvas.position_map,
-                                                       width=100, height=100)
+                                                       width=100, height=100,
+                                                       progressive=True)
         self.canvas.update_layout()
 
     def KamadaKawaiLayout(self, event):