File: basic.at

package info (click to toggle)
igraph 0.7.1-4
  • links: PTS, VCS
  • area: main
  • in suites: buster
  • size: 19,500 kB
  • sloc: ansic: 188,142; sh: 26,731; cpp: 18,275; yacc: 1,164; makefile: 957; lex: 484; xml: 405
file content (81 lines) | stat: -rw-r--r-- 2,727 bytes parent folder | download | duplicates (5)
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
# Check the basic (interface) functions and implicitly also compilation

# Test suite for the IGraph library.
# Copyright (C) 2005-2012  Gabor Csardi <csardi.gabor@gmail.com>
# 334 Harvard street, 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

# Macros

AT_BANNER([[Basic (interface) functions.]])

AT_SETUP([Creating an empty graph (igraph_empty): ])
AT_KEYWORDS([igraph_empty])
AT_COMPILE_CHECK([simple/igraph_empty.c])
AT_CLEANUP

AT_SETUP([Copying a graph (igraph_copy): ])
AT_KEYWORDS([igraph_copy igraph_create])
AT_COMPILE_CHECK([simple/igraph_copy.c])
AT_CLEANUP

AT_SETUP([Adding edges to a graph (igraph_add_edges): ])
AT_KEYWORDS([igraph_add_edges])
AT_COMPILE_CHECK([simple/igraph_add_edges.c], 
	[simple/igraph_add_edges.out])
AT_CLEANUP

AT_SETUP([Adding vertices (igraph_add_vertices): ])
AT_KEYWORDS([igraph_add_vertices])
AT_COMPILE_CHECK([simple/igraph_add_vertices.c])
AT_CLEANUP

AT_SETUP([Deleting edges (igraph_delete_edges): ])
AT_KEYWORDS([igraph_delete_vertices])
AT_COMPILE_CHECK([simple/igraph_delete_edges.c])
AT_CLEANUP

AT_SETUP([Deleting vertices (igraph_delete_vertices): ])
AT_KEYWORDS([igraph_delete_vertices])
AT_COMPILE_CHECK([simple/igraph_delete_vertices.c])
AT_CLEANUP

AT_SETUP([Neighbors (igraph_neighbors): ])
AT_KEYWORDS([igraph_neighbors])
AT_COMPILE_CHECK([simple/igraph_neighbors.c], [simple/igraph_neighbors.out])
AT_CLEANUP

AT_SETUP([Is the graph directed? (igraph_is_directed): ])
AT_KEYWORDS([igraph_is_directed])
AT_COMPILE_CHECK([simple/igraph_is_directed.c])
AT_CLEANUP

AT_SETUP([Degree of the vertices (igraph_degree): ])
AT_KEYWORDS([igraph_degree])
AT_COMPILE_CHECK([simple/igraph_degree.c], [simple/igraph_degree.out])
AT_CLEANUP

AT_SETUP([Query edge ids (igraph_get_eid): ])
AT_KEYWORDS([igraph_get_eid edge id])
AT_COMPILE_CHECK([simple/igraph_get_eid.c], [simple/igraph_get_eid.out])
AT_CLEANUP

AT_SETUP([Query many edge ids (igraph_get_eids): ])
AT_KEYWORDS([igraph_get_eids edge id])
AT_COMPILE_CHECK([simple/igraph_get_eids.c], [simple/igraph_get_eids.out])
AT_CLEANUP