# HG changeset patch
# User Robert L. Miller <rlm@rlmiller.org>
# Date 1262449027 28800
# Node ID c7e2e10d10d6b04ab9544172ac610513fdc88e5d
# Parent b09b0a0aedf629b0bb8bf02d35d783b888545ae2
Proper use of get_vertex/vertex_label
diff -r b09b0a0aedf6 -r c7e2e10d10d6 sage/graphs/base/c_graph.pyx
a
|
b
|
|
1451 | 1451 | |
1452 | 1452 | sage: DiGraph(2*graphs.PetersenGraph(),implementation="c_graph").is_connected() |
1453 | 1453 | False |
| 1454 | |
| 1455 | A graph with non-integer vertex labels:: |
| 1456 | sage: Graph(graphs.CubeGraph(3), implementation='c_graph').is_connected() |
| 1457 | True |
| 1458 | |
1454 | 1459 | """ |
1455 | 1460 | |
1456 | 1461 | cdef int v_int = 0 |
… |
… |
|
1458 | 1463 | |
1459 | 1464 | if v_int == -1: |
1460 | 1465 | return True |
1461 | | |
1462 | | return len(list(self.depth_first_search(get_vertex(v_int, self.vertex_ints, self.vertex_labels, self._cg),\ |
1463 | | ignore_direction=True))\ |
1464 | | ) == (<CGraph>self._cg).num_verts |
| 1466 | v = vertex_label(v_int, self.vertex_ints, self.vertex_labels, self._cg) |
| 1467 | return len(list(self.depth_first_search(v, ignore_direction=True)) ) == (<CGraph>self._cg).num_verts |
1465 | 1468 | |
1466 | 1469 | def is_strongly_connected(self): |
1467 | 1470 | r""" |
… |
… |
|
1489 | 1492 | if v_int == -1: |
1490 | 1493 | return True |
1491 | 1494 | |
1492 | | v = get_vertex(v_int, self.vertex_ints, self.vertex_labels, self._cg) |
| 1495 | v = vertex_label(v_int, self.vertex_ints, self.vertex_labels, self._cg) |
1493 | 1496 | |
1494 | 1497 | return (<CGraph>self._cg).num_verts == len(list(self.depth_first_search(v))) and \ |
1495 | 1498 | (<CGraph>self._cg).num_verts == len(list(self.depth_first_search(v, reverse=True))) |