File: igraph_es_path.c

package info (click to toggle)
igraph 0.7.1-2
  • links: PTS, VCS
  • area: main
  • in suites: jessie, jessie-kfreebsd
  • size: 19,180 kB
  • ctags: 16,601
  • sloc: ansic: 188,037; sh: 26,731; cpp: 18,275; yacc: 1,164; makefile: 959; lex: 484; xml: 378
file content (73 lines) | stat: -rw-r--r-- 2,020 bytes parent folder | download | duplicates (3)
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
/* -*- mode: C -*-  */
/* 
   IGraph library.
   Copyright (C) 2006-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 <time.h>
#include <stdlib.h>

int main() {
  
  igraph_t g;
  igraph_es_t es;
  igraph_eit_t eit;
  igraph_integer_t size;

  /* DIRECTED */
  
  igraph_ring(&g, 10, IGRAPH_DIRECTED, 0, 1);
  igraph_es_path_small(&es, IGRAPH_DIRECTED, 0,1,2,3,4,5,6,7,8,9,0,1,2,3, -1);
  igraph_eit_create(&g, es, &eit);
  igraph_es_size(&g, &es, &size);
  while (!IGRAPH_EIT_END(eit)) {
    long int edge=IGRAPH_EIT_GET(eit);
    igraph_integer_t from, to;
    igraph_edge(&g, edge, &from, &to);
    IGRAPH_EIT_NEXT(eit);
    size--;
  }
  if (size != 0) return 1;

  igraph_eit_destroy(&eit);
  igraph_es_destroy(&es);
  igraph_destroy(&g);

  /* UNDIRECTED */
  
  igraph_ring(&g, 10, IGRAPH_UNDIRECTED, 0, 1);
  igraph_es_path_small(&es, IGRAPH_DIRECTED, 
		       0,1,2,3,4,3,2,3,4,5,6,5,4,5,6,7,8,9,0,1,0,9, -1);
  igraph_eit_create(&g, es, &eit);
  while (!IGRAPH_EIT_END(eit)) {
    long int edge=IGRAPH_EIT_GET(eit);
    igraph_integer_t from, to;
    igraph_edge(&g, edge, &from, &to);
    IGRAPH_EIT_NEXT(eit);
  }

  igraph_eit_destroy(&eit);
  igraph_es_destroy(&es);
  igraph_destroy(&g);
  

  return 0;
}