应用斐波纳契堆和邻接表改进单源最短路径算法，使其算法的时间复杂性由O( )减少为O（nlogn+e）,其中e为有向图的边的条数。-application Fibonacci heap and the adjacent table to improve single source shortest path algorithm, its algorithm's time complexity of O () reduced to O (nlogn e), where e is for th

数据结构,利用循环链表实现斐波那契数列的输出。-data structure

各种各样的高级数据结构原理以及C++实现，例如红黑树，哈希表，笛卡尔树，字典树，斐波那契堆，二叉堆，SBT等等。-The wide range of advanced data structural principle C++ of implementation, such as red-black trees, hash tables, Cartesian tree dictionary tree, Fibonacci heap, binary heap, SBT and so on.

此程序为C++语言的程序，可以输出斐波那契数列，特点是采用线性表的数据结构处理加法运算，对每一位数进行运算，并进位，解决了由于int或long int甚至unsigned long int(0~2^32-1=4294967295)的精度范围限制，此算法的精度范围主要受项数n(int)的范围(1~2^31-1=2147483647)影响-This program is C++ language program, you can output the Fibonacci sequence, is c