# HG changeset patch
# User Nathann Cohen
# Date 1354441987 -3600
# Node ID 972b6b9702c8bce95430761f9a11f9cfd5849c2b
# Parent 6c35651a6718fe66082d7198c5360700f7a6ac5e
Move methods from GenericGraph to Graph -- Bugfix
diff --git a/sage/graphs/generic_graph.py b/sage/graphs/generic_graph.py
--- a/sage/graphs/generic_graph.py
+++ b/sage/graphs/generic_graph.py
@@ -224,7 +224,7 @@
:meth:`~GenericGraph.connected_components_subgraphs` | Returns a list of connected components as graph objects.
:meth:`~GenericGraph.connected_component_containing_vertex` | Returns a list of the vertices connected to vertex.
:meth:`~GenericGraph.blocks_and_cut_vertices` | Computes the blocks and cut vertices of the graph.
- :meth=`~GenericGraph.is_cut_edge` | Returns True if the input edge is a cut-edge or a bridge.
+ :meth:=`~GenericGraph.is_cut_edge` | Returns True if the input edge is a cut-edge or a bridge.
:meth:`~GenericGraph.is_cut_vertex` | Returns True if the input vertex is a cut-vertex.
:meth:`~GenericGraph.edge_cut` | Returns a minimum edge cut between vertices `s` and `t`
:meth:`~GenericGraph.vertex_cut` | Returns a minimum vertex cut between non-adjacent vertices `s` and `t`
diff --git a/sage/graphs/graph.py b/sage/graphs/graph.py
--- a/sage/graphs/graph.py
+++ b/sage/graphs/graph.py
@@ -4899,7 +4899,7 @@
sage: (graphs.FruchtGraph()).cores(with_labels=True)
{0: 3, 1: 3, 2: 3, 3: 3, 4: 3, 5: 3, 6: 3, 7: 3, 8: 3, 9: 3, 10: 3, 11: 3}
sage: a=random_matrix(ZZ,20,x=2,sparse=True, density=.1)
- sage: b=DiGraph(20)
+ sage: b=Graph(20)
sage: b.add_edges(a.nonzero_positions())
sage: cores=b.cores(with_labels=True); cores
{0: 3, 1: 3, 2: 3, 3: 3, 4: 2, 5: 2, 6: 3, 7: 1, 8: 3, 9: 3, 10: 3, 11: 3, 12: 3, 13: 3, 14: 2, 15: 3, 16: 3, 17: 3, 18: 3, 19: 3}