DynamicNetworks/EdgeFinder.h at master · WouterSpekkink/DynamicNetworks · GitHub

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
/*
 Copyright 2014 Wouter Spekkink
 Authors : Wouter Spekkink <wouter.spekkink@gmail.com>
 Website : http://www.wouterspekkink.org

 This file is part of Dynamic Networks.

 DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.

 Copyright 2014 Wouter Spekkink. All rights reserved.

 Dynamic Networks 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.

 Dynamic Networks 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 Foobar.  If not, see <http://www.gnu.org/licenses/>.

*/
#ifndef EDGEFINDER_H
#define EDGEFINDER_H

#include <QObject>
#include <vector>
#include <string>
#include "MatCollection.h"
#include "ProgressBar.h"

class EdgeFinder : public QObject {

    Q_OBJECT

public:
    EdgeFinder() {}

    // This constructor expects that a type of network is indicated
    EdgeFinder(MatCollection *collection, std::string userType, bool userSlide);

    // This constructor also expects an ego
    EdgeFinder(MatCollection *collection, std::string userType, std::string agent, bool userSlide);

    ~EdgeFinder() {}

    const std::vector<std::vector <int> > GetEdges();
    const std::vector<std::string> GetNames();
    const std::vector<std::string> GetIntervals();
    const std::vector<std::string> GetAttributeInterval();
    const std::vector<std::string> GetHeader();

private:
    MatCollection *sourceCollection;
    std::vector<std::vector <int> > edges;
    std::vector<std::string> namesTrans;
    std::vector<std::string> intervalTrans;
    std::vector<std::string> attributeInterval;
    std::string networkType;
    std::string ego;
    bool slide;
    ProgressBar *loadProgress;

    /* CalcIntervals() creates the translation list for time intervals
       CalcEdges fills the vector of edges */
    std::vector<std::string> CalcIntervals(bool weight);
    std::vector<std::vector <int> > CalcEdges();
    std::vector<std::vector <int> > CalcEdges(std::string agent);

    /* The collection is the collection of adjacency matrices that
       we will get our edges from. namesTrans and intervalTrans are
       used to translate the edges (stored as ints) to source and target
       names and to strings that represent time intervals.
       networkType is used to determine what type of network should be
       created. */

};

#endif