summaryrefslogtreecommitdiff
path: root/lib/include/network.hpp
blob: 8211cfc26e1d4a64873108a60c30ebf4a1e3f11f (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
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
83
84
85
86
87
88
89
90
91
92
93
94
95

#pragma once

#include <vector>
#include <functional>
#include <utility>
#include <random>
#include <limits>
#include <valarray>
#include <set>

#include "problem.hpp"
#include "graph.hpp"
#include "hooks.hpp"
#include "current_info.hpp"
#include "array_hash.hpp"

#define CURRENT_CUTOFF 1e-10

#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/connected_components.hpp>
#include <boost/graph/depth_first_search.hpp>
#include <boost/range/combine.hpp>
#include <boost/foreach.hpp>
#include <boost/graph/graph_utility.hpp>
#include <boost/graph/incremental_components.hpp>
#include <boost/pending/disjoint_sets.hpp>

struct EdgeProperties {
  unsigned index;
};

typedef boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::no_property, EdgeProperties> Graph;
typedef boost::graph_traits<Graph>::vertex_descriptor Vertex;
typedef boost::graph_traits<Graph>::vertices_size_type VertexIndex;

class network {
  public:
    const graph& G;

    Graph bG;
    Graph dG;
    std::vector<VertexIndex> rank;
    std::vector<Vertex> parent;
    boost::disjoint_sets<VertexIndex*, Vertex*> ds;
    std::unordered_map<std::array<unsigned, 2>, bool> seen_pairs;

    std::vector<bool> fuses;
    std::vector<bool> backbone;
    std::vector<long double> thresholds;

    problem px;
    problem py;

    network(const graph&, cholmod_common*);
    network(const network&);

    void set_thresholds(double, std::mt19937&);
    void fracture(hooks&, bool one_axis = false);
    void update_backbone(const std::vector<double>& c);

    void break_edge(unsigned, bool unbreak = false);
    virtual current_info get_current_info() {current_info empty; return empty;};
};

class fuse_network : public network {
  private:
    double weight;

  public:
    fuse_network(const graph&, cholmod_common*, double weight = 1.0);
    fuse_network(const fuse_network&);

    current_info get_current_info() override;
};

class elastic_network : public network {
  private:
    double weight;

  public:
    elastic_network(const graph&, cholmod_common*, double weight = 0.5);
    elastic_network(const elastic_network&);

    current_info get_current_info() override;
};

class percolation_network : public network {
  public:
    percolation_network(const graph&, cholmod_common*);
    percolation_network(const percolation_network&);

    current_info get_current_info() override;
};