File: infomap_FlowGraph.h

package info (click to toggle)
igraph 0.8.5%2Bds1-1
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 11,284 kB
  • sloc: ansic: 97,287; cpp: 22,541; yacc: 1,150; makefile: 546; lex: 478; xml: 450; pascal: 82; sh: 9
file content (78 lines) | stat: -rw-r--r-- 2,111 bytes parent folder | download | duplicates (6)
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
/* -*- mode: C -*-  */
/* vim:set ts=4 sw=4 sts=4 et: */
/*
   IGraph library.
   Copyright (C) 2011-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

*/

#ifndef FLOWGRAPH_H
#define FLOWGRAPH_H

#include <vector>
#include <set>

#include "igraph_interface.h"

#include "infomap_Node.h"

class FlowGraph {
private:
    void init(int n, const igraph_vector_t *nodeWeights);

public:
    FlowGraph(int n);
    FlowGraph(int n, const igraph_vector_t *nodeWeights);
    FlowGraph(FlowGraph * fgraph);
    FlowGraph(FlowGraph * fgraph, int sub_Nnode, int * sub_members);

    FlowGraph(const igraph_t * graph, const igraph_vector_t *e_weights,
              const igraph_vector_t *v_weights);

    ~FlowGraph();

    void swap(FlowGraph * fgraph);

    void initiate();
    void eigenvector();
    void calibrate();

    void back_to(FlowGraph * fgraph);

    /*************************************************************************/
    Node **node;
    int  Nnode;

    double alpha, beta;

    int Ndanglings;
    std::vector<int> danglings; // id of dangling nodes

    double exit;                  //
    double exitFlow;              //
    double exit_log_exit;         //
    double size_log_size;         //
    double nodeSize_log_nodeSize; // \sum_{v in V} p log(p)

    double codeLength;
};

void delete_FlowGraph(FlowGraph *fgraph);

#endif