1 /* A Fibonacci heap datatype.
2 Copyright 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2009
3 Free Software Foundation, Inc.
4 Contributed by Daniel Berlin (dan@cgsoftware.com).
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it
9 under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GCC is distributed in the hope that it will be useful, but
14 WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to
20 the Free Software Foundation, 51 Franklin Street - Fifth Floor,
21 Boston, MA 02110-1301, USA. */
23 /* Fibonacci heaps are somewhat complex, but, there's an article in
24 DDJ that explains them pretty well:
26 http://www.ddj.com/articles/1997/9701/9701o/9701o.htm?topic=algoritms
28 Introduction to algorithms by Corman and Rivest also goes over them.
30 The original paper that introduced them is "Fibonacci heaps and their
31 uses in improved network optimization algorithms" by Tarjan and
32 Fredman (JACM 34(3), July 1987).
34 Amortized and real worst case time for operations:
36 ExtractMin: O(lg n) amortized. O(n) worst case.
37 DecreaseKey: O(1) amortized. O(lg n) worst case.
38 Insert: O(2) amortized. O(1) actual.
39 Union: O(1) amortized. O(1) actual. */
50 typedef long fibheapkey_t
;
52 typedef struct fibheap
59 typedef struct fibnode
61 struct fibnode
*parent
;
62 struct fibnode
*child
;
64 struct fibnode
*right
;
67 #if defined (__GNUC__) && (!defined (SIZEOF_INT) || SIZEOF_INT < 4)
68 __extension__
unsigned long int degree
: 31;
69 __extension__
unsigned long int mark
: 1;
71 unsigned int degree
: 31;
72 unsigned int mark
: 1;
76 extern fibheap_t
fibheap_new (void);
77 extern fibnode_t
fibheap_insert (fibheap_t
, fibheapkey_t
, void *);
78 extern int fibheap_empty (fibheap_t
);
79 extern fibheapkey_t
fibheap_min_key (fibheap_t
);
80 extern fibheapkey_t
fibheap_replace_key (fibheap_t
, fibnode_t
,
82 extern void *fibheap_replace_key_data (fibheap_t
, fibnode_t
,
83 fibheapkey_t
, void *);
84 extern void *fibheap_extract_min (fibheap_t
);
85 extern void *fibheap_min (fibheap_t
);
86 extern void *fibheap_replace_data (fibheap_t
, fibnode_t
, void *);
87 extern void *fibheap_delete_node (fibheap_t
, fibnode_t
);
88 extern void fibheap_delete (fibheap_t
);
89 extern fibheap_t
fibheap_union (fibheap_t
, fibheap_t
);
95 #endif /* _FIBHEAP_H_ */
This page took 0.030453 seconds and 4 git commands to generate.