# HG changeset patch
# User Jason Grout <jason-sage@creativetrax.com>
# Date 1226555367 21600
# Node ID db6a1548cac9b94d65f0011dee14401ceec586be
# Parent  e11337594d8c1ca4785284853739ea3e125a0e66
[mq]: long-doctest-segfault.patch

diff -r e11337594d8c -r db6a1548cac9 sage/graphs/planarity.pyx
--- a/sage/graphs/planarity.pyx	Wed Nov 12 23:06:01 2008 -0600
+++ b/sage/graphs/planarity.pyx	Wed Nov 12 23:49:27 2008 -0600
@@ -41,12 +41,23 @@
         (see g.get_embedding())
         circular -- if True, test for circular planarity
     
-    EXAMPLE:
+    EXAMPLES:
         sage: G = Graph(graphs.DodecahedralGraph(), implementation='networkx')
         sage: from sage.graphs.planarity import is_planar
         sage: is_planar(G)
         True
         sage: Graph('@').is_planar()
+        True
+
+    TESTS:
+        We try checking the planarity of all graphs on 7 or fewer
+        vertices.  In fact, to try to track down a segfault, we do it
+        twice.
+        sage: import networkx.generators.atlas  # long time
+        sage: atlas_graphs = [Graph(i) for i in networkx.generators.atlas.graph_atlas_g()] # long time
+        sage: a = [i for i in [1..1252] if atlas_graphs[i].is_planar()] # long time
+        sage: b = [i for i in [1..1252] if atlas_graphs[i].is_planar()] # long time
+        sage: a == b # long time
         True
     """
     # First take care of a trivial case.  We ignore the set_pos,