开通博客赚积分
发布资源赚积分
分类

源码开发语言/平台
当前位置：首页 > 源码/资料 > 数值算法/人工智能 > 查看源码
Tables.tex
资源名称：leda.tar.gz　[点击查看]
上传用户：gzelex
上传日期：2007-01-07
资源大小：707k
文件大小：9k
源码类别：

数值算法/人工智能

开发平台：

MultiPlatform

Tables.tex：源码内容
  1. chapter{Tables} label{Tables}
  3. section{Data Types} label{Table Data Types}
  5. begin{tabular}{lllll}
  6. {bf Name}         &{bf Item}      &{bf Header}      &{bf Library}  &{bf Page}\
  7. array              &------          &array.h           &libL.a         &pageref{One Dimensional Arrays}\
  8. array2             &------          &array2.h          &libL.a         &pageref{Two Dimensional Arrays}\
  9. b_node_pq        &------          &b_node_pq.h     &libG.a         &pageref{Bounded Node Priority Queues}\
  10. b_priority_queue &b_pq_item     &b_prio.h         &libL.a         &pageref{Bounded Priority Queues}\
  11. b_queue           &------          &b_queue.h        &libL.a         &pageref{Bounded Queues}\
  12. b_stack           &------          &b_stack.h        &libL.a         &pageref{Bounded Stacks}\
  13. circle             &------          &circle.h           &libP.a         &pageref{Circles}\
  14. cmd_istream       &------          &stream.h          &libL.a         &pageref{Command Input Streams}\
  15. cmd_ostream       &------          &stream.h          &libL.a         &pageref{Command Output Streams}\
  16. d2_dictionary      &d2_dic_item   &d2_dictionary.h  &libP.a         &pageref{Two-Dimensional Dictionaries}\
  17. d_array            &------          &d_array.h        &libL.a         &pageref{Dictionary Arrays}\
  18. dictionary          &dic_item       &dictionary.h      &libL.a         &pageref{Dictionaries}\
  19. edge_array         &------          &edge_array.h     &libG.a         &pageref{Edge Arrays}\
  20. edge_map           &------          &edge_map.h        &libG.a         &pageref{Edge Maps}\
  21. edge_set           &------          &edge_set.h       &libG.a         &pageref{Sets of Edges}\
  22. file_istream       &------          &stream.h          &libL.a         &pageref{File Input Streams}\
  23. file_ostream       &------          &stream.h          &libL.a         &pageref{File Output Streams}\
  24. floatf              &------          &floatf.h          &libL.a         &pageref{A Floating Point Filter}\
  25. graph               &node/edge       &graph.h           &libG.a         &pageref{Graphs}\
  26. GRAPH               &node/edge       &graph.h           &libG.a         &pageref{Parameterized Graphs}\
  27. h_array            &------          &h_array.h        &libL.a         &pageref{Hashing Arrays}\
  28. integer             &------          &integer.h         &libL.a         &pageref{Integers of Arbitrary Length}\
  29. int_set            &------          &int_set.h        &libL.a         &pageref{Integer Sets}\
  30. interval_set       &is_item        &interval_set.h   &libP.a         &pageref{Sets of Intervals}\
  31. line                &------          &line.h            &libP.a         &pageref{Straight Lines}\
  32. list                &list_item      &list.h            &libL.a         &pageref{Linear Lists}\
  33. map                 &------          &map.h             &libL.a         &pageref{Maps}\
  34. matrix              &------          &matrix.h          &libL.a         &pageref{Real-Valued Matrices}\
  35. node_array         &------          &node_array.h     &libG.a         &pageref{Node Arrays}\
  36. node_list          &------          &node_list.h       &libG.a         &pageref{Lists of Nodes}\
  37. node_map           &------          &node_map.h        &libG.a         &pageref{Node Maps}\
  38. end{tabular}
  40. begin{tabular}{lllll}
  41. node_matrix        &------          &graph.h           &libG.a         &pageref{Two Dimensional Node Arrays}\
  42. node_partition     &------          &node_partition.h &libG.a         &pageref{Node Partitions}\
  43. node_pq            &------          &node_pq.h        &libG.a         &pageref{Node Priority Queues}\
  44. node_set           &------          &node_set.h       &libG.a         &pageref{Sets of Nodes}\
  45. panel               &------          &panel.h           &libP.a/libWx.a &pageref{Panels}\
  46. partition           &partition_item &partition.h       &libL.a         &pageref{Partitions}\
  47. planar_map         &node/edge/face  &planar_map.h     &libG.a         &pageref{Planar Maps}\
  48. point               &------          &point.h           &libP.a         &pageref{Points}\
  49. point_set          &ps_item        &point_set.h      &libP.a         &pageref{Sets of Two-Dimensional Points}\
  50. polygon             &------          &polygon.h         &libP.a         &pageref{Polygons}\
  51. p_queue            &pq_item        &p_queue.h         &libL.a         &pageref{Priority Queues}\
  52. p_dictionary       &p_dic_item    &p_dictionary.h   &libL.a         &pageref{Persistent Dictionaries}\
  53. PLANAR_MAP         &node/edge/face  &planar_map.h     &libG.a         &pageref{Parameterized Planar Maps}\
  54. queue               &------          &queue.h           &libL.a         &pageref{Queues}\
  55. rational            &------          &rational.h        &libL.a         &pageref{Rational Numbers}\
  56. rat_point          &------          &rat_point.h      &libP.a         &pageref{Rational Points}\
  57. rat_segment        &------          &rat_segment.h    &libP.a         &pageref{Rational Segments}\
  58. real                &------          &real.h            &libL.a         &pageref{Real Numbers}\
  59. segment             &------          &segment.h         &libP.a         &pageref{Segments}\
  60. segment_set        &seg_item       &segment_set.h    &libP.a         &pageref{Sets of Parallel Segments}\
  61. set                 &------          &set.h             &libL.a         &pageref{Sets}\
  62. sortseq             &seq_item       &sortseq.h         &libL.a         &pageref{Sorted Sequences}\
  63. stack               &------          &stack.h           &libL.a         &pageref{Stacks}\
  64. string              &------          &string.h          &libL.a         &pageref{Strings}\
  65. string_istream     &------          &stream.h          &libL.a         &pageref{String Input Streams}\
  66. string_ostream     &------          &stream.h          &libL.a         &pageref{String Output Streams}\
  67. subdivision         &node/face       &subdivision.h     &libP.a         &pageref{Planar Subdivisions}\
  68. tree_collection    &d_vertex       &tree_collection.h&libL.a         &pageref{Dynamic Collections of Trees}\
  69. ugraph              &node/edge       &ugraph.h          &libG.a         &pageref{Undirected Graphs}\
  70. UGRAPH              &node/edge       &ugraph.h          &libG.a         &pageref{Parameterized Ugraphs}\
  71. vector              &------          &vector.h          &libL.a         &pageref{Real-Valued Vectors}\
  72. window              &------          &window.h          &libP.a/libWx.a &pageref{Graphic Windows}\
  73. end{tabular}
  76. newpage
  78. section{Algorithms}  label{Table Algorithms}
  80. bigskip
  81. begin{tabular}{llll}
  82. {bf Name}                     &{bf Header}      &{bf Library}  &{bf Page}\
  83. noalign{smallskip}
  84. ALL_PAIRS_SHORTEST_PATHS       &graph_alg.h   &libG.a           &pageref{Network Algorithms}\
  85. BELLMAN_FORD                     &graph_alg.h   &libG.a           &pageref{Network Algorithms}\
  86. BFS                               &graph_alg.h   &libG.a           &pageref{Basic Algorithms}\
  87. COMPONENTS                        &graph_alg.h   &libG.a           &pageref{Basic Algorithms}\
  88. CONVEX_HULL                      &plane_alg.h   &libP.a           &pageref{Plane Algorithms}\
  89. DFS                               &graph_alg.h   &libG.a           &pageref{Basic Algorithms}\
  90. DFS_NUM                          &graph_alg.h   &libG.a           &pageref{Basic Algorithms}\
  91. DIJKSTRA                          &graph_alg.h   &libG.a           &pageref{Network Algorithms}\
  92. MAX_CARD_MATCHING               &graph_alg.h   &libG.a           &pageref{Network Algorithms}\
  93. MAX_CARD_BIPARTITE_MATCHING    &graph_alg.h   &libG.a           &pageref{Network Algorithms}\
  94. MAX_FLOW                         &graph_alg.h   &libG.a           &pageref{Network Algorithms}\
  95. MAX_WEIGHT_MATCHING             &graph_alg.h   &libG.a           &pageref{Network Algorithms}\
  96. MAX_WEIGHT_BIPARTITE_MATCHING  &graph_alg.h   &libG.a           &pageref{Network Algorithms}\
  97. MIN_CUT                          &graph_alg.h   &libG.a           &pageref{Network Algorithms}\
  98. MIN_COST_MAX_FLOW              &graph_alg.h   &libG.a           &pageref{Network Algorithms}\
  99. MIN_SPANNING_TREE               &graph_alg.h   &libG.a           &pageref{Network Algorithms}\
  100. PLANAR                            &graph_alg.h   &libG.a           &pageref{Algorithms for Planar Graphs}\
  101. SEGMENT_INTERSECTION             &plane_alg.h   &libP.a           &pageref{Plane Algorithms}\
  102. SPANNING_TREE                    &graph_alg.h   &libG.a           &pageref{Network Algorithms}\
  103. STRAIGHT_LINE_EMBEDDING         &graph_alg.h   &libG.a           &pageref{Algorithms for Planar Graphs}\
  104. STRONG_COMPONENTS                &graph_alg.h   &libG.a           &pageref{Basic Algorithms}\
  105. SWEEP_SEGMENTS                   &plane_alg.h   &libP.a           &pageref{Plane Algorithms}\
  106. TOPSORT                           &graph_alg.h   &libG.a           &pageref{Basic Algorithms}\
  107. TRANSITIVE_CLOSURE               &graph_alg.h   &libG.a           &pageref{Basic Algorithms}\
  108. TRIANGULATE_PLANAR_MAP          &graph_alg.h   &libG.a           &pageref{Algorithms for Planar Graphs}\
  109. VORONOI                           &plane_alg.h   &libP.a           &pageref{Plane Algorithms}
  110. end{tabular}