File: flows.py

package info (click to toggle)
isospec 2.3.2-2
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 12,472 kB
  • sloc: cpp: 9,530; python: 2,095; makefile: 180; ansic: 100; sh: 88
file content (97 lines) | stat: -rw-r--r-- 3,296 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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
import networkx
import IsoSpecPy
import math
import sys
import numpy as np
from pprint import pprint

from parameters import int_fact, integerize, flows_loud, emp_grad_dval


def awsd_g(exp, the_l, exp_ab_cost, th_ab_cost):
    exp_ab_cost = int(exp_ab_cost * int_fact)
    th_ab_cost = int(th_ab_cost * int_fact)
    G = networkx.DiGraph()

    exp_sum = sum(x[1] for x in integerize(exp))
    the_sum = sum((sum(x[1] for x in integerize(the_s))) for the_s in the_l)

    for mass, prob in integerize(exp):
        G.add_edge('source', (mass, -1), capacity = prob, weight = 0)
        G.add_edge((mass, -1), 'middle', weight = exp_ab_cost)
#        if exp_sum > the_sum:
#            G.add_edge((mass, -1), 'sink', weight = exp_ab_cost)

    for idx, the_iso in enumerate(the_l):
        for mass, prob in integerize(the_iso):
            G.add_edge((mass, idx), 'sink', capacity = prob, weight = 0)
            G.add_edge('middle', (mass, idx), weight = th_ab_cost)
#            if exp_sum <= the_sum:
#                G.add_edge('source', (mass, idx), weight = th_ab_cost)

    for emass, eprob in integerize(exp):
        for idx, the_iso in enumerate(the_l):
            for tmass, tprob in integerize(the_iso):
                G.add_edge((emass, -1), (tmass, idx), weight = abs(emass - tmass)) #, exp_ab_cost + th_ab_cost)
#                G.add_edge((tmass, idx), (emass, -1), weight = abs(emass - tmass))

    G.add_edge('source', 'middle', capacity = the_sum, weight = 0)
    G.add_edge('middle', 'sink', capacity = exp_sum, weight = 0)

    flow = networkx.max_flow_min_cost(G, 'source', 'sink')

#    print(flow)

    tot_cost = 0
    gradient_exp = 0
    gradient_thr = [0] * len(the_l)
    gradient_exp = 0
    gradient_thr = [0] * len(the_l)

    for start_n, neigh in flow.items():
        for end_n, fl_v in neigh.items():
            # Cost computation
            tot_cost += fl_v * G.edges[start_n, end_n]['weight']
            capacity = G.edges[start_n, end_n].get('capacity', math.inf)
#            print(start_n, end_n, "flow:", fl_v, "weight:", G.edges[start_n, end_n]['weight'], "capacity:", G.edges[start_n, end_n].get('capacity', 'inf'))

            # Grad computation

    def has_spare_flow(exp_peak):
        if exp_peak == 'middle':
            return True
        return flow[exp_peak]['middle'] > 0.0


#    pprint(flow)

    masses2probs = [{mass:prob for mass, prob in integerize(the)} for the in the_l]

    grad = np.zeros(len(the_l), dtype=float)
    for th in G.predecessors('sink'):
        if th != 'middle':
            if flow['middle'][th] > 0.0:
                grad[th[1]] += th_ab_cost * masses2probs[th[1]][th[0]]
            else:
                delta = min(
                                G[exp_p][th]['weight'] if th != 'middle'
                                else math.inf
                                for exp_p in G.predecessors(th)
                            )
                #print("Delta:", delta)

                grad[th[1]] += (delta - exp_ab_cost) * masses2probs[th[1]][th[0]]
                

    return tot_cost/int_fact/int_fact, grad/int_fact/int_fact

def awsd(exp, the_l, exp_ab_cost, th_ab_cost):
    return awsd_g(exp, the_l, exp_ab_cost, th_ab_cost)[0]


if __name__ == '__main__':
    from test_spectra import *