summaryrefslogtreecommitdiff
path: root/src/kruskal/edge_w_funs.h
blob: bb6fd9c69fe6269cfe34bbcce8ca3e6f3fcfa551 (plain)
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
/**
 *  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 3 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, see
 *  <http://www.gnu.org/licenses/>.
 *
 *  (c) Vincenzo Nicosia 2009-2017 -- <v.nicosia@qmul.ac.uk>
 * 
 *  This file is part of NetBunch, a package for complex network
 *  analysis and modelling. For more information please visit:
 *
 *             http://www.complex-networks.net/
 *
 *  If you use this software, please add a reference to 
 *
 *               V. Latora, V. Nicosia, G. Russo             
 *   "Complex Networks: Principles, Methods and Applications"
 *              Cambridge University Press (2017) 
 *                ISBN: 9781107103184
 *
 ***********************************************************************
 */

#ifndef __EDGE_W_FUNS_H__
#define __EDGE_W_FUNS_H__

typedef struct{
  unsigned int i;
  unsigned int j;
  double w;
} edge_w_t;


int compare_edge_w(const void *e1, const void *e2);

void* alloc_vector_edge_w(unsigned int N);

void dealloc_vector_edge_w(void *v);

void dealloc_elem_edge_w(void *e);

void print_elem_edge_w(void *e);


#endif //__EDGE_W_FUNS_H__