Trac #20095: Report broken links in the doc of graphs/

With this branch, no new broken link can appear in the documentation of
the graph/ files. All currently broken links are also fixed.

Nathann

URL: http://trac.sagemath.org/20095
Reported by: ncohen
Ticket author(s): Nathann Cohen
Reviewer(s): David Coudert

src/sage/graphs/generators/classical_geometries.py

@@ -833,7 +833,7 @@ def TaylorTwographDescendantSRG(q, clique_partition=None):
     obtained as a two-graph descendant of the
     :func:`Taylor's two-graph <sage.combinat.designs.twographs.taylor_twograph>` `T`.
     This graph admits a partition into cliques of size `q`, which are useful in
-    :func:`TaylorTwographSRG <sage.graphs.generators.classical_geometries.TaylorTwographSRG>`,
+    :func:`~sage.graphs.graph_generators.GraphGenerators.TaylorTwographSRG`,
     a strongly regular graph on `q^3+1` vertices in the
     Seidel switching class of `T`, for which we need `(q^2+1)/2` cliques.
     The cliques are the `q^2` lines on `v_0` of the projective plane containing the unital
@@ -919,7 +919,7 @@ def TaylorTwographSRG(q):
 
     .. SEEALSO::
 
-        * :func:`TaylorTwographDescendantSRG <sage.graphs.generators.classical_geometries.TaylorTwographDescendantSRG>`
+        * :meth:`~sage.graphs.graph_generators.GraphGenerators.TaylorTwographDescendantSRG`
 
     EXAMPLES::
 

src/sage/graphs/generators/families.py

@@ -697,7 +697,7 @@ def GoethalsSeidelGraph(k,r):
     in Theorem 2.4 of [GS70]_. It relies on a :func:`(v,k)-BIBD
     <sage.combinat.designs.bibd.balanced_incomplete_block_design>` with `r`
     blocks and a
-    :func:`~sage.combinat.matrices.hadamard_matrix.hadamard_matrix>` of order
+    :func:`~sage.combinat.matrices.hadamard_matrix.hadamard_matrix` of order
     `r+1`. The result is a
     :func:`sage.graphs.strongly_regular_db.strongly_regular_graph` on `v(r+1)`
     vertices with degree `k=(n+r-1)/2`.
@@ -1599,18 +1599,20 @@ def PasechnikGraph(n):
     """
     Pasechnik strongly regular graph on `(4n-1)^2` vertices
 
-    A strongly regular graph with parameters of the orthogonal array graph
-    :func:`OrthogonalArrayBlockGraph
-    <sage.graphs.generateudo_L_2n_4n_m_1ors.GraphGenerators.OrthogonalArrayBlockGraph>`, also
-    known as pseudo Latin squares graph `L_{2n-1}(4n-1)`, constructed from a
-    skew Hadamard matrix of order `4n` following [Pa92]_.
+    A strongly regular graph with parameters of the orthogonal array
+    graph
+    :func:`~sage.graphs.graph_generators.GraphGenerators.OrthogonalArrayBlockGraph`,
+    also known as pseudo Latin squares graph `L_{2n-1}(4n-1)`,
+    constructed from a skew Hadamard matrix of order `4n` following
+    [Pa92]_.
 
     EXAMPLES::
 
         sage: graphs.PasechnikGraph(4).is_strongly_regular(parameters=True)
         (225, 98, 43, 42)
         sage: graphs.PasechnikGraph(9).is_strongly_regular(parameters=True) # long time
         (1225, 578, 273, 272)
+
     """
     from sage.combinat.matrices.hadamard_matrix import skew_hadamard_matrix
     from sage.matrix.constructor import identity_matrix, matrix
@@ -1627,7 +1629,7 @@ def SquaredSkewHadamardMatrixGraph(n):
 
     A strongly regular graph with parameters of the orthogonal array graph
     :func:`OrthogonalArrayBlockGraph
-    <sage.graphs.generators.GraphGenerators.OrthogonalArrayBlockGraph>`, also
+    <sage.graphs.graph_generators.GraphGenerators.OrthogonalArrayBlockGraph>`, also
     known as pseudo Latin squares graph `L_{2n}(4n-1)`, constructed from a
     skew Hadamard matrix of order `4n`, due to Goethals and Seidel, see [BvL84]_.
 
@@ -1658,7 +1660,7 @@ def SwitchedSquaredSkewHadamardMatrixGraph(n):
     A strongly regular graph in the
     :meth:`Seidel switching <Graph.seidel_switching>` class of the disjoint union of
     a 1-vertex graph and the one produced by :func:`Pseudo-L_{2n}(4n-1)
-    <sage.graphs.generators.GraphGenerators.SquaredSkewHadamardMatrixGraph>`
+    <sage.graphs.graph_generators.GraphGenerators.SquaredSkewHadamardMatrixGraph>`
 
     In this case, the other possible parameter set of a strongly regular graph in the
     Seidel switching class of the latter graph (see [BH12]_) coincides with the set

src/sage/graphs/generators/random.py

@@ -995,7 +995,7 @@ def RandomTriangulation(n, set_position=False):
     .. SEEALSO::
 
         :meth:`~sage.graphs.graph_generators.GraphGenerators.triangulations`,
-        :meth:`~sage.homology.examples.RandomTwoSphere`.
+        :func:`~sage.homology.examples.RandomTwoSphere`.
 
     EXAMPLES::
 

src/sage/graphs/generic_graph.py

@@ -1637,11 +1637,13 @@ def to_dictionary(self, edge_labels=False, multiple_edges=False):
         return d
 
     def adjacency_matrix(self, sparse=None, vertices=None):
-        """
+        r""" 
         Returns the adjacency matrix of the (di)graph.
 
-        The matrix returned is over the integers. If a different ring is
-        desired, use either :meth:`sage.matrix.matrix0.Matrix.change_ring` method or :func:`matrix`
+        The matrix returned is over the integers. If a different ring
+        is desired, use either
+        :meth:`sage.matrix.matrix0.Matrix.change_ring` method or
+        :class:`matrix <sage.matrix.constructor.MatrixFactory>`
         function.
 
         INPUT:

src/sage/graphs/generic_graph_pyx.pyx

@@ -396,7 +396,7 @@ def small_integer_to_graph6(n):
 
 def length_and_string_from_graph6(s):
     r"""
-    Returns a pair `(length,graph6_string)` from a graph6 string of unknown length.
+    Returns a pair ``(length,graph6_string)`` from a graph6 string of unknown length.
 
     This helper function is the inverse of `N` from [McK]_.
 

src/sage/graphs/graph.py

@@ -4829,20 +4829,23 @@ def seidel_adjacency_matrix(self, vertices=None):
         r"""
         Returns the Seidel adjacency matrix of ``self``.
 
-        Returns `J-I-2A`, for `A` the (ordinary)
-        :meth:`adjacency matrix <GenericGraph.adjacency_matrix>` of ``self``,
-        `I` the identity matrix, and `J` the all-1 matrix.
+        Returns `J-I-2A`, for `A` the (ordinary) :meth:`adjacency
+        matrix
+        <sage.graphs.generic_graph.GenericGraph.adjacency_matrix>` of
+        ``self``, `I` the identity matrix, and `J` the all-1 matrix.
         It is closely related to :meth:`twograph`.
 
         The matrix returned is over the integers. If a different ring is
         desired, use either :meth:`sage.matrix.matrix0.Matrix.change_ring`
-        method or :func:`matrix` function.
+        method or :class:`matrix <sage.matrix.constructor.MatrixFactory>` function.
 
         INPUT:
 
-        - ``vertices`` (list) -- the ordering of the vertices defining how they
-          should appear in the matrix. By default, the ordering given by
-          :meth:`GenericGraph.vertices` is used.
+        - ``vertices`` (list) -- the ordering of the vertices defining
+          how they should appear in the matrix. By default, the
+          ordering given by
+          :meth:`~sage.graphs.generic_graph.GenericGraph.vertices` is
+          used.
 
         EXAMPLES::
 

src/sage/graphs/schnyder.py

@@ -525,8 +525,8 @@ def _compute_coordinates(g, x):
 
 class TreeNode():
     """
-    A class to represent each node in the trees used by :func:`_realizer` and
-    :func:`_compute_coordinates` when finding a planar geometric embedding in
+    A class to represent each node in the trees used by ``_realizer`` and
+    ``_compute_coordinates`` when finding a planar geometric embedding in
     the grid.
 
     Each tree node is doubly linked to its parent and children.