]>
Commit | Line | Data |
---|---|---|
502b8322 | 1 | /* Et-forest data structure implementation. |
71f3e391 JM |
2 | Copyright (C) 2002, 2003, 2004, 2005, 2007, 2010 |
3 | Free Software Foundation, Inc. | |
f1cfb09f | 4 | |
9dcd6f09 NC |
5 | This program is free software; you can redistribute it and/or modify |
6 | it under the terms of the GNU General Public License as published by | |
7 | the Free Software Foundation; either version 3 of the License, or | |
8 | (at your option) any later version. | |
f1cfb09f | 9 | |
9dcd6f09 NC |
10 | This program is distributed in the hope that it will be useful, |
11 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
12 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
13 | GNU General Public License for more details. | |
f1cfb09f | 14 | |
9dcd6f09 NC |
15 | You should have received a copy of the GNU General Public License |
16 | along with this program; see the file COPYING3. If not see | |
17 | <http://www.gnu.org/licenses/>. */ | |
f1cfb09f | 18 | |
502b8322 | 19 | /* This package implements ET forest data structure. Each tree in |
f1cfb09f JH |
20 | the structure maintains a tree structure and offers logarithmic time |
21 | for tree operations (insertion and removal of nodes and edges) and | |
fbe5a4a6 | 22 | poly-logarithmic time for nearest common ancestor. |
502b8322 | 23 | |
d91edf86 | 24 | ET tree stores its structure as a sequence of symbols obtained |
f1cfb09f JH |
25 | by dfs(root) |
26 | ||
502b8322 | 27 | dfs (node) |
f1cfb09f JH |
28 | { |
29 | s = node; | |
30 | for each child c of node do | |
31 | s = concat (s, c, node); | |
32 | return s; | |
33 | } | |
502b8322 | 34 | |
f1cfb09f | 35 | For example for tree |
502b8322 | 36 | |
f1cfb09f JH |
37 | 1 |
38 | / | \ | |
39 | 2 3 4 | |
40 | / | | |
41 | 4 5 | |
502b8322 | 42 | |
f1cfb09f | 43 | the sequence is 1 2 4 2 5 3 1 3 1 4 1. |
502b8322 | 44 | |
e0bb17a8 | 45 | The sequence is stored in a slightly modified splay tree. |
f1cfb09f JH |
46 | In order to support various types of node values, a hashtable |
47 | is used to convert node values to the internal representation. */ | |
48 | ||
49 | #ifndef _ET_TREE_H | |
50 | #define _ET_TREE_H | |
51 | ||
f1cfb09f JH |
52 | #ifdef __cplusplus |
53 | extern "C" { | |
54 | #endif /* __cplusplus */ | |
55 | ||
d47cc544 SB |
56 | /* The node representing the node in an et tree. */ |
57 | struct et_node | |
58 | { | |
59 | void *data; /* The data represented by the node. */ | |
60 | ||
61 | int dfs_num_in, dfs_num_out; /* Number of the node in the dfs ordering. */ | |
62 | ||
63 | struct et_node *father; /* Father of the node. */ | |
64 | struct et_node *son; /* The first of the sons of the node. */ | |
65 | struct et_node *left; | |
66 | struct et_node *right; /* The brothers of the node. */ | |
67 | ||
71cc389b KH |
68 | struct et_occ *rightmost_occ; /* The rightmost occurrence. */ |
69 | struct et_occ *parent_occ; /* The occurrence of the parent node. */ | |
d47cc544 SB |
70 | }; |
71 | ||
72 | struct et_node *et_new_tree (void *data); | |
73 | void et_free_tree (struct et_node *); | |
bef87a34 | 74 | void et_free_tree_force (struct et_node *); |
5a6ccafd | 75 | void et_free_pools (void); |
d47cc544 SB |
76 | void et_set_father (struct et_node *, struct et_node *); |
77 | void et_split (struct et_node *); | |
78 | struct et_node *et_nca (struct et_node *, struct et_node *); | |
79 | bool et_below (struct et_node *, struct et_node *); | |
66f97d31 | 80 | struct et_node *et_root (struct et_node *); |
f1cfb09f JH |
81 | |
82 | #ifdef __cplusplus | |
83 | } | |
84 | #endif /* __cplusplus */ | |
85 | ||
86 | #endif /* _ET_TREE_H */ |