graph-bibtex/authors.py at master · RasmusAndersen/graph-bibtex · 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
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
import pygraphviz as pgv


#  Authors class
class Authors(object):

    def __init__(self, main_author_first, main_author_sur):
        # The list of authors
        self.list_of_authors = [{'surname': main_author_sur, 'firstname': main_author_first, 'hfactor': 0, 'noPub': 0, 'relations': 0, 'level': 0}]
        # The list of relations
        self.list_of_relations = []
        self.rel_max = 0
        self.before = 3000
        self.after = 1900
        self.article_fact = 1
        self.proc_fact = 1
        self.book_fact = 1

    def author_append(self, this_surname, this_firstname):
        append_bool = 1
        for idx in range(0, len(self.list_of_authors)):
            idx_surname = self.list_of_authors[idx]['surname']
            idx_firstname = self.list_of_authors[idx]['firstname']
            # if Name already exists in database, do not add it
            if this_surname in idx_surname and this_firstname[0] in idx_firstname:
                append_bool = 0
                # if firstname in database is shorter than this_firstname, replace it
                if len(this_firstname) > len(idx_firstname):
                    self.list_of_authors[idx]['firstname'] = this_firstname
        if append_bool > 0:
            self.list_of_authors.append({'surname': this_surname, 'firstname': this_firstname, 'hfactor': 0, 'noPub': 0, 'relations': 0, 'level': 256})

    # ------------------------------------------------------------------------------------------------
    def create_author_list(self, bib_database):
        for articles in bib_database.entries:

            authors_of_article = articles['author']
            # If Authors are delimited by ' and '
            if ' and ' in authors_of_article:
                full_names = authors_of_article.split(' and ')

                for s_aut in full_names:
                    # Format Nikneijad, Ali M.
                    if ', ' in s_aut:
                        names = s_aut.split(', ')
                        this_surname = names[0]
                        this_firstname = names[1]
                    # Format Ali M. Nikneijad
                    else:
                        names = s_aut.split(' ')
                        this_firstname = names[0]
                        this_surname = names[-1]  # last element
                        if len(names) > 2:
                            for x in range(1, len(names) - 1):
                                this_firstname = this_firstname + ' ' + names[x]
                                # Check if author is already in list, otherwise append
                    self.author_append(this_surname, this_firstname)

            elif '.,' in authors_of_article:

                full_names = authors_of_article.split('.,')
                for s_aut in full_names:
                    names = s_aut.split(', ')

                    if len(names) > 1:  # Check if names is empty
                        this_surname = names[0]
                        this_firstname = names[1]
                        if this_firstname[-1] is not '.':
                            this_firstname = this_firstname + '.'

                    self.author_append(this_surname, this_firstname)

            elif ',' in authors_of_article:
                full_names = authors_of_article.split(',')
                for i in range(0, int(len(full_names) / 2)):
                    this_surname = full_names[2 * i].strip()
                    this_firstname = full_names[2 * i + 1].strip()

                    self.author_append(this_surname, this_firstname)

        print('No of Authors: ' + str(len(self.list_of_authors)))

    # -----------------------------------------------------------------------------
    def create_relations(self, bib_database):

        length = len(self.list_of_authors)

        for i in range(0, length):
            aut_name_i = self.list_of_authors[i]['surname'] + ', ' + self.list_of_authors[i]['firstname'][0]
            lvl_i = self.list_of_authors[i]['level']

            # increase number of publications for author
            for articles in bib_database.entries:
                if aut_name_i in articles['author'] and self.before > int(articles['year']) > self.after:
                    self.list_of_authors[i]['noPub'] += 1

            # In my old script version, J was iterated from i (instead i+1).
            # This was not a problem with the old script, as the self- nodes were removed (or not drawn).

            for j in range(i + 1, length):
                this_firstname = self.list_of_authors[j]['firstname']
                this_surname = self.list_of_authors[j]['surname']
                aut_name_j = this_surname + ', ' + this_firstname[0]
                rel = 0

                lvl_j = self.list_of_authors[j]['level']

                for articles in bib_database.entries:
                    if aut_name_i in articles['author'] and aut_name_j in articles['author'] and self.before > int(articles['year']) > self.after:

                        rel = rel + 1

                        if lvl_i < lvl_j:
                            lvl_j = lvl_i + 1
                        elif lvl_i > lvl_j:
                            lvl_i = lvl_j + 1

                self.list_of_authors[i]['level'] = lvl_i
                self.list_of_authors[j]['level'] = lvl_j

                if rel > 0:
                    self.list_of_relations.append([i, j, rel])
                    self.list_of_authors[i]['relations'] += rel
                    self.list_of_authors[j]['relations'] += rel

                    # increase counter for maximum relationshsip number
                    if rel > self.rel_max:
                        self.rel_max = rel

        print('No of relations: ' + str(len(self.list_of_relations)))

    # ------------------------------------------------------------------------------------------------


class AuthorsGraph(pgv.AGraph):
    def __init__(self):
        # colors
        self.my_colorscheme = 'X11'
        self.node_fill_color = 'deepskyblue2'
        self.node_outline_color = 'navy'
        self.edge_color = 'firebrick'
        self.node_font_color = 'navy'
        self.aut_pub_thr = 1
        self.aut_edge_thr = 1
        self.edge_rel_thr = 1
        self.level = 1
        self.before = 0
        self.after = 0
        super(AuthorsGraph, self).__init__(strict=False, directed=False, splines=True, style='filled', colorscheme=self.my_colorscheme)

    def add_author_nodes(self, This_Authors):
        print('Add Nodes to Graph')
        for idx in range(0, len(This_Authors.list_of_authors)):
            if This_Authors.list_of_authors[idx]['noPub'] >= self.aut_pub_thr and This_Authors.list_of_authors[idx]['level'] <= self.level:
                graph_label = This_Authors.list_of_authors[idx]['surname'] + '&#92;n' + This_Authors.list_of_authors[idx]['firstname'] + '&#92;n' + str(This_Authors.list_of_authors[idx]['noPub'])

                self.add_node(idx, label=graph_label)
                self.node_attr.update(style='filled', color=self.node_outline_color, penwidth=3, fillcolor=self.node_fill_color, fontcolor=self.node_font_color)

    def add_author_edges(self, This_Authors):
        print('Add Edges to Graph')
        for rel in This_Authors.list_of_relations:
            if rel[2] >= self.edge_rel_thr and self.has_node(rel[0]) and self.has_node(rel[1]):
                rel_width = float(rel[2]) / This_Authors.rel_max * 4 + 1
                self.add_edge(rel[0], rel[1], label=rel[2], weigth=rel[2], dir='none', penwidth=rel_width, color=self.edge_color)

    def remove_author_nodes(self):

        print('Compact Graph')
        remove = [node for node in self.nodes() if self.degree(node) < self.aut_rel_thr]
        self.remove_nodes_from(remove)
        print('Remaining Edges: ' + str(self.number_of_edges()))