# HG changeset patch
# User Nathann Cohen <nathann.cohen@gmail.com>
# Date 1283801054 -7200
# Node ID a0fbc6d387c3f151229da9b9ea168ee5f539f11a
# Parent 0de59778cea7df7bd656ae07169118634b2c3e96
trac 9862 - some documentation in graphs constructors related to interval graphs
diff -r 0de59778cea7 -r a0fbc6d387c3 sage/graphs/graph_generators.py
a
|
b
|
|
4025 | 4025 | |
4026 | 4026 | This definitions follows [boucheron2001]_. |
4027 | 4027 | |
| 4028 | .. NOTE:: |
| 4029 | |
| 4030 | The vertices are named 0, 1, 2, and so on. The intervals |
| 4031 | used to create the graph are saved with the graph and can |
| 4032 | be recovered using ``get_vertex()`` or ``get_vertices()``. |
| 4033 | |
4028 | 4034 | INPUT: |
4029 | 4035 | |
4030 | 4036 | - ``n`` (integer) -- the number of vertices in the random |
… |
… |
|
4063 | 4069 | vertex, two vertices being adjacent if the two corresponding |
4064 | 4070 | (closed) intervals intersect. |
4065 | 4071 | |
4066 | | The vertices are named 0, 1, 2, and so on. The intervals used |
4067 | | to create the graph are saved with the graph and can be |
4068 | | recovered using g.get_vertex() or g.get_vertices(). |
4069 | | |
4070 | 4072 | INPUT: |
4071 | 4073 | |
4072 | 4074 | - ``intervals`` -- the list of pairs `(a_i,b_i)` |
4073 | 4075 | defining the graph. |
4074 | 4076 | |
4075 | | NOTE: |
4076 | | |
4077 | | The intervals `(a_i,b_i)` need not verify `a_i<b_i`. |
| 4077 | .. NOTE:: |
| 4078 | |
| 4079 | * The vertices are named 0, 1, 2, and so on. The |
| 4080 | intervals used to create the graph are saved with the |
| 4081 | graph and can be recovered using ``get_vertex()`` or |
| 4082 | ``get_vertices()``. |
| 4083 | |
| 4084 | * The intervals `(a_i,b_i)` need not verify `a_i<b_i`. |
4078 | 4085 | |
4079 | 4086 | EXAMPLE: |
4080 | 4087 | |