|
4634 | 4634 | <a class="indexterm" name="id-1.18.5.24.2"></a><p> |
4635 | 4635 | </p> |
4636 | 4636 | <div class="informalexample"><pre class="programlisting"> |
4637 | | -igraph_error_t igraph_girth(const igraph_t *graph, igraph_real_t *girth, |
4638 | | - igraph_vector_int_t *circle); |
| 4637 | +igraph_error_t igraph_girth(const igraph_t *graph, |
| 4638 | + igraph_real_t *girth, |
| 4639 | + igraph_vector_int_t *cycle); |
4639 | 4640 | </pre></div> |
4640 | 4641 | <p> |
4641 | 4642 | </p> |
|
4693 | 4694 | </p></td> |
4694 | 4695 | </tr> |
4695 | 4696 | <tr> |
4696 | | -<td><p><span class="term"><em class="parameter"><code>circle</code></em>:</span></p></td> |
| 4697 | +<td><p><span class="term"><em class="parameter"><code>cycle</code></em>:</span></p></td> |
4697 | 4698 | <td><p> |
4698 | 4699 | Pointer to an initialized vector, the vertex IDs in |
4699 | | - the shortest circle will be stored here. If <code class="constant">NULL</code> then it is |
4700 | | - ignored. |
| 4700 | + the shortest cycle of length at least 3 will be stored here. |
| 4701 | + If <code class="constant">NULL</code> then it is ignored. |
4701 | 4702 | </p></td> |
4702 | 4703 | </tr> |
4703 | 4704 | </tbody> |
@@ -14753,7 +14754,7 @@ <h3 class="title">Warning</h3> |
14753 | 14754 | <td><p> |
14754 | 14755 | Pointer to a matrix, the result of the calculation will |
14755 | 14756 | be stored here. The number of its rows and columns is the same |
14756 | | - as the number of vertex IDs in <em class="parameter"><code>vit_from</code></em> and <em class="parameter"><code>vit_to</code></em>, respectively. |
| 14757 | + as the number of vertex IDs in <em class="parameter"><code>from</code></em> and <em class="parameter"><code>to</code></em>, respectively. |
14757 | 14758 | </p></td> |
14758 | 14759 | </tr> |
14759 | 14760 | <tr> |
@@ -15500,7 +15501,7 @@ <h3 class="title">Warning</h3> |
15500 | 15501 | </p> |
15501 | 15502 | <div class="informalexample"><pre class="programlisting"> |
15502 | 15503 | igraph_error_t igraph_similarity_dice(const igraph_t *graph, igraph_matrix_t *res, |
15503 | | - const igraph_vs_t vit_from, const igraph_vs_t vit_to, |
| 15504 | + const igraph_vs_t from, const igraph_vs_t to, |
15504 | 15505 | igraph_neimode_t mode, igraph_bool_t loops); |
15505 | 15506 | </pre></div> |
15506 | 15507 | <p> |
@@ -15534,18 +15535,18 @@ <h3 class="title">Warning</h3> |
15534 | 15535 | <td><p> |
15535 | 15536 | Pointer to a matrix, the result of the calculation will |
15536 | 15537 | be stored here. The number of its rows and columns is the same |
15537 | | - as the number of vertex IDs in <em class="parameter"><code>vit_from</code></em> and <em class="parameter"><code>vit_to</code></em>, respectively. |
| 15538 | + as the number of vertex IDs in <em class="parameter"><code>from</code></em> and <em class="parameter"><code>to</code></em>, respectively. |
15538 | 15539 | </p></td> |
15539 | 15540 | </tr> |
15540 | 15541 | <tr> |
15541 | | -<td><p><span class="term"><em class="parameter"><code>vit_from</code></em>:</span></p></td> |
| 15542 | +<td><p><span class="term"><em class="parameter"><code>from</code></em>:</span></p></td> |
15542 | 15543 | <td><p> |
15543 | 15544 | The vertex IDs of the first vertices of the |
15544 | 15545 | pairs for which the calculation will be done. |
15545 | 15546 | </p></td> |
15546 | 15547 | </tr> |
15547 | 15548 | <tr> |
15548 | | -<td><p><span class="term"><em class="parameter"><code>vit_to</code></em>:</span></p></td> |
| 15549 | +<td><p><span class="term"><em class="parameter"><code>to</code></em>:</span></p></td> |
15549 | 15550 | <td><p> |
15550 | 15551 | The vertex IDs of the second vertices of the |
15551 | 15552 | pairs for which the calculation will be done. |
|
0 commit comments