# HG changeset patch
# User Nathann Cohen <nathann.cohen@gmail.com>
# Date 1250277039 -7200
# Node ID 04b079e4087b6afa37b9de61496bd1c45d84a3a3
# Parent 684eea91ff224e5bc6259ca19f1576c4c082b9d3
All the cliquer-related functions in the Graph class are documented, but they do not appear in SAGE's reference as they all use functions defined in graphs/cliquer, which is not included in the .rst file.
This patch fixes this, plus adds a few lines to the docstrings in cliquer.pyx
diff -r 684eea91ff22 -r 04b079e4087b doc/en/reference/graphs.rst
a
|
b
|
|
4 | 4 | .. toctree:: |
5 | 5 | :maxdepth: 2 |
6 | 6 | |
| 7 | sage/graphs/cliquer |
7 | 8 | sage/graphs/graph |
8 | 9 | sage/graphs/graph_generators |
9 | 10 | sage/graphs/graph_database |
diff -r 684eea91ff22 -r 04b079e4087b sage/graphs/cliquer.pyx
a
|
b
|
|
| 1 | r""" |
| 2 | Cliquer : routines for finding cliques in graphs |
| 3 | |
| 4 | This module defines functions based on Cliquer, an exact branch-and-bound algorithm developped by Patric R. J. Ostergard and written by Sampo Niskanen. |
| 5 | |
| 6 | AUTHORS: |
| 7 | |
| 8 | - Nathann Cohen (2009-08-14): Initial version |
| 9 | |
| 10 | Functions |
| 11 | ------------------------------ |
| 12 | |
| 13 | """ |
1 | 14 | def max_clique(graph): |
2 | 15 | """ |
3 | 16 | Returns the vertex set of a maximum complete subgraph. |