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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
|
/*
igraph library.
Copyright (C) 2011-2012 Gabor Csardi <csardi.gabor@gmail.com>
334 Harvard st, Cambridge MA, 02139 USA
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>
#include <string.h>
int main(void) {
igraph_t g;
igraph_vector_t weights;
igraph_vector_int_t result;
igraph_bool_t dag;
/* Initialize the library. */
igraph_setup();
igraph_vector_int_init(&result, 0);
/***********************************************************************/
/* Approximation with Eades' method */
/***********************************************************************/
/* Simple unweighted graph */
igraph_small(&g, 0, IGRAPH_DIRECTED, 0, 1, 1, 2, 2, 0, 2, 3, 2, 4, 0, 4, 4, 3, 5, 0, 6, 5, -1);
igraph_feedback_arc_set(&g, &result, 0, IGRAPH_FAS_APPROX_EADES);
igraph_vector_int_print(&result);
igraph_delete_edges(&g, igraph_ess_vector(&result));
igraph_is_dag(&g, &dag);
if (!dag) {
return 1;
}
igraph_destroy(&g);
/* Simple weighted graph */
igraph_small(&g, 0, IGRAPH_DIRECTED, 0, 1, 1, 2, 2, 0, 2, 3, 2, 4, 0, 4, 4, 3, 5, 0, 6, 5, -1);
igraph_vector_init_int_end(&weights, -1, 1, 1, 3, 1, 1, 1, 1, 1, 1, -1);
igraph_feedback_arc_set(&g, &result, &weights, IGRAPH_FAS_APPROX_EADES);
igraph_vector_int_print(&result);
igraph_delete_edges(&g, igraph_ess_vector(&result));
igraph_is_dag(&g, &dag);
if (!dag) {
return 2;
}
igraph_vector_destroy(&weights);
igraph_destroy(&g);
/* Simple unweighted graph with loops */
igraph_small(&g, 0, IGRAPH_DIRECTED, 0, 1, 1, 2, 2, 0, 2, 3, 2, 4, 0, 4, 4, 3, 5, 0, 6, 5, 1, 1, 4, 4, -1);
igraph_feedback_arc_set(&g, &result, 0, IGRAPH_FAS_APPROX_EADES);
igraph_vector_int_print(&result);
igraph_delete_edges(&g, igraph_ess_vector(&result));
igraph_is_dag(&g, &dag);
if (!dag) {
return 3;
}
igraph_destroy(&g);
/* Null graph */
igraph_empty(&g, 0, IGRAPH_DIRECTED);
igraph_feedback_arc_set(&g, &result, NULL, IGRAPH_FAS_APPROX_EADES);
if (igraph_vector_int_size(&result) != 0) {
return 4;
}
igraph_destroy(&g);
/* Singleton graph */
igraph_empty(&g, 1, IGRAPH_DIRECTED);
igraph_feedback_arc_set(&g, &result, NULL, IGRAPH_FAS_APPROX_EADES);
if (igraph_vector_int_size(&result) != 0) {
return 5;
}
igraph_destroy(&g);
igraph_vector_int_destroy(&result);
return 0;
}
|
