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
|
# -*- coding: utf-8 -*-
# Copyright (C) 2011-2012 by the Free Software Foundation, Inc.
#
# 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.
"""
Analysis of messages or threads of messages
Author: Aurelien Bompard <abompard@fedoraproject.org>
"""
import networkx as nx
def compute_thread_order_and_depth(thread):
graph = nx.DiGraph()
thread_pos = {"d": 0, "o": 0} # depth, order
def walk_successors(msgid):
obj = graph.node[msgid]["obj"]
obj.thread_depth = thread_pos["d"]
obj.thread_order = thread_pos["o"]
thread_pos["d"] += 1
thread_pos["o"] += 1
for succ in sorted(graph.successors(msgid),
key=lambda m: graph.node[m]["num"]):
walk_successors(succ)
thread_pos["d"] -= 1
for index, email in enumerate(thread.emails):
graph.add_node(email.message_id, num=index, obj=email)
if email.in_reply_to is not None:
graph.add_edge(email.in_reply_to, email.message_id)
walk_successors(thread.starting_email.message_id)
|
