1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
|
/* -*- mode: C -*- */
/*
IGraph library.
Copyright (C) 2009-2021 The igraph development team
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301 USA
*/
#include <igraph.h>
int main(void) {
igraph_t graph, ring;
igraph_vector_int_t order, rank, father, pred, succ, dist;
/* Create a disjoint union of two rings */
igraph_ring(&ring, 10, /*directed=*/ 0, /*mutual=*/ 0, /*circular=*/ 1);
igraph_disjoint_union(&graph, &ring, &ring);
igraph_destroy(&ring);
/* Initialize the vectors where the result will be stored. Any of these
* can be omitted and replaced with a null pointer when calling
* igraph_bfs() */
igraph_vector_int_init(&order, 0);
igraph_vector_int_init(&rank, 0);
igraph_vector_int_init(&father, 0);
igraph_vector_int_init(&pred, 0);
igraph_vector_int_init(&succ, 0);
igraph_vector_int_init(&dist, 0);
/* Now call the BFS function */
igraph_bfs(&graph, /*root=*/0, /*roots=*/ NULL, /*neimode=*/ IGRAPH_OUT,
/*unreachable=*/ 1, /*restricted=*/ NULL,
&order, &rank, &father, &pred, &succ, &dist,
/*callback=*/ NULL, /*extra=*/ NULL);
/* Print the results */
igraph_vector_int_print(&order);
igraph_vector_int_print(&rank);
igraph_vector_int_print(&father);
igraph_vector_int_print(&pred);
igraph_vector_int_print(&succ);
igraph_vector_int_print(&dist);
/* Cleam up after ourselves */
igraph_vector_int_destroy(&order);
igraph_vector_int_destroy(&rank);
igraph_vector_int_destroy(&father);
igraph_vector_int_destroy(&pred);
igraph_vector_int_destroy(&succ);
igraph_vector_int_destroy(&dist);
igraph_destroy(&graph);
return 0;
}
|
