|
|
|
 |
판매가 |
55,300원 → 50,500원  9% |
|
|
마일리지 |
 1% 510원 |
|
|
발행일 |
2001-12-20 | 중량: 0.61 kg | 사이즈: 19.4*23.1*2 cm
|
|
ISBN |
0201729148 | 9780201729146
|
|
기타정보 |
원서 | 304쪽
| $ 44.99
|
|
|
예상출고일
|
12~18일 소요예정 (근무일기준) |
|
배송비 |
무료배송
|
| |
|
정가, 판매가는 항공 운임료 포함 |
|
|
|
 |
| 프로그래밍언어
|
|
|
|
|
|
주의사항 |
- 현지사정에 의해 지연, 품절 될 수 있습니다.- 해외주문원서는 취소 및 반품이 불가능합니다(단, 파본이나 오발송은 제외 입니다.)- 수입절차/입고소요기간 자세히 |
|
|
 |
|
| The first C++ library to apply the principles of generic programming to the construction of the advanced data structures and algorithms used in graph computations. Offers the key to unlocking the power of the BGL for the C++ programmer looking to extend the reach of generic programming beyond the Standard Template Library. Softcover. CD-ROM included. |
 |
|
 |
Foreword xiii
Preface xvii
I User Guide 1
1 Introduction 3
1.1 Some Graph Terminology 3
1.2 Graph Concepts 5
1.2.1 Vertex and Edge Descriptors 5
1.2.2 Property Maps 6
1.2.3 Graph Traversal 7
1.2.4 Graph Construction and Modification 9
1.2.5 Algorithm Visitors 10
1.3 Graph Classes and Adaptors 11
1.3.1 Graph Classes 11
1.3.2 Graph Adaptors 13
1.4 Generic Graph Algorithms 13
1.4.1 The Topological Sort Generic Algorithm 14
1.4.2 The Depth-First Search Generic Algorithm 18
2 Generic Programming in C++ 19
2.1 Introduction 19
2.1.1 Polymorphism in Object-Oriented Programming 20
2.1.2 Polymorphism in Generic Programming 21
2.1.3 Comparison of GP and OOP 22
2.2 Generic Programming and the STL 25
2.3 Concepts and Models 27
2.3.1 Sets of Requirements 28
2.3.2 Example: InputIterator 28
2.4 Associated Types and Traits Classes 30
2.4.1 Associated Types Needed in Function Template 30
2.4.2 Typedefs Nested in Classes 30
2.4.3 Definition of a Traits Class 31
2.4.4 Partial Specialization 32
2.4.5 Tag Dispatching 33
2.5 Concept Checking 34
2.5.1 Concept-Checking Classes 35
2.5.2 Concept Archetypes 36
2.6 The Boost Namespace 37
2.6.1 Classes 37
2.6.2 Koenig Lookup 38
2.7 Named Function Parameters 39
3 A BGL Tutorial 41
3.1 File Dependencies 41
3.2 Graph Setup 42
3.3 Compilation Order 44
3.3.1 Topological Sort via DFS 44
3.3.2 Marking Vertices Using External Properties 46
3.3.3 Accessing Adjacent Vertices 46
3.3.4 Traversing All the Vertices 47
3.4 Cyclic Dependencies 48
3.5 Toward a Generic DFS: Visitors 49
3.6 Graph Setup: Internal Properties 52
3.7 Compilation Time 54
3.8 A Generic Topological Sort and DFS 55
3.9 Parallel Compilation Time 57
3.10 Summary 59
4 Basic Graph Algorithms 61
4.1 Breadth-First Search 61
4.1.1 Definitions 61
4.1.2 Six Degrees of Kevin Bacon 62
4.2 Depth-First Search 67
4.2.1 Definitions 67
4.2.2 Finding Loops in Program-Control-Flow Graphs 69
5 Shortest-Paths Problems 75
5.1 Definitions 75
5.2 Internet Routing 76
5.3 Bellman-Ford and Distance Vector Routing 77
5.4 Dijkstra and Link-State Routing 81
6 Minimum-Spanning-Tree Problem 89
6.1 Definitions 89
6.2 Telephone Network Planning 89
6.3 Kruskal's Algorithm 91
6.4 Prim's Algorithm 94
7 Connected Components 97
7.1 Definitions 97
7.2 Connected Components and Internet Connectivity 98
7.3 Strongly Connected Components and Web Page Links 102
8 Maximum Flow 105
8.1 Definitions 105
8.2 Edge Connectivity 106
9 Implicit Graphs: A Knight's Tour 113
9.1 Knight's Jumps as a Graph 114
9.2 Backtracking Graph Search 116
9.3 Warnsdorff's Heuristic 117
10 Interfacing with Other Graph Libraries 119
10.1 Using BGL Topological Sort with a LEDA Graph 120
10.2 Using BGL Topological Sort with a SGB Graph 122
10.3 Implementing Graph Adaptors 123
11 Performance Guidelines 127
11.1 Graph Class Comparisons 127
11.1.1 The Results and Discussion 128
11.2 Conclusion 132
II Reference Manual 135
12 BGL Concepts 137
12.1 Graph Traversal Concepts 137
12.1.1 Undirected Graphs 138
12.1.2 Graph 142
12.1.3 IncidenceGraph 143
12.1.4 BidirectionalGraph 145
12.1.5 AdjacencyGraph 146
12.1.6 VertexListGraph 147
12.1.7 EdgeListGraph 148
12.1.8 AdjacencyMatrix 149
12.2 Graph Modification Concepts 150
12.2.1 VertexMutableGraph 152
12.2.2 EdgeMutableGraph 152
12.2.3 MutableIncidenceGraph 154
12.2.4 MutableBidirectionalGraph 154
12.2.5 MutableEdgeListGraph 155
12.2.6 PropertyGraph 155
12.2.7 VertexMutablePropertyGraph 156
12.2.8 EdgeMutablePropertyGraph 157
12.3 Visitor Concepts 158
12.3.1 BFSVisitor 158
12.3.2 DFSVisitor 160
12.3.3 DijkstraVisitor 161
12.3.4 BellmanFordvisitor 162
13 BGL Algorithms 163
13.1 Overview 163
13.2 Basic Algorithms 165
13.2.1 Breadth_first_search 165
13.2.2 Breadth_first_visit 169
13.2.3 Depth_first_search 170
13.2.4 Depth_first_visit 175
13.2.5 Topological_sort 176
13.3 Shortest-Path Algorithms 177
13.3.1 Dijkstra_shortest_paths 177
13.3.2 Bellman_ford_shortest_paths 182
13.3.3 Johnson_all_pairs_shortest_paths 186
13.4 Minimum-Spanning-Tree Algorithms 189
13.4.1 Kruskal_minimum_spanning_tree 189
13.4.2 Prim_minimum_spanning_tree 192
13.5 Static Connected Components 195
13.5.1 Connected_components 195
13.5.2 Strong_components 198
13.6 Incremental Connected Components 201
13.6.1 Initialize_incremental_components 203
13.6.2 Incremental_components 203
13.6.3 same_component 204
13.6.4 component_index 204
13.7 Maximum-Flow Algorithms 206
13.7.1 edmunds_karp_max_flow 206
13.7.2 push_relabel_max_flow 209
14 BGL Classes 213
14.1 Graph Classes 213
14.1.1 adjacency_list 213
14.1.2 adjacency_matrix 235
14.2 Auxiliary Classes 242
14.2.1 graph_traits 242
14.2.2 adjacency_list_traits 245
14.2.3 adjacency_matrix_traits 247
14.2.4 property_map 248
14.2.5 property 249
14.3 Graph Adaptors 251
14.3.1 edge_list 251
14.3.2 reverse_graph 252
14.3.3 filtered_graph 257
14.3.4 SGB Graph Pointer 262
14.3.5 LEDA GRAPH[left angle bracket]V,E[right angle bracket] 267
14.3.6 std::vector[left angle bracket]EdgeList[right angle bracket] 272
15 Property Map Library 277
15.1 Property Map Concepts 278
15.1.1 ReadablePropertyMap 279
15.1.2 WritablePropertyMap 280
15.1.3 ReadWritePropertyMap 281
15.1.4 LvaluePropertyMap 281
15.2 Property Map Classes 281
15.2.1 property_traits 281
15.2.2 iterator_property_map 283
15.2.3 Property Tags 285
15.3 Creating Your Own Property Maps 285
15.3.1 Property Maps for Stanford GraphBase 286
15.3.2 A Property Map Implemented with std::map 287
16 Auxiliary Concepts, Classes, and Functions 289
16.1 Buffer 289
16.2 ColorValue 290
16.3 MultiPassInputlterator 291
16.4 Monoid 291
16.5 mutable_queue 292
16.6 Disjoint Sets 293
16.6.1 disjoint_sets 293
16.6.2 find_with_path_halving 295
16.6.3 find_with_full_path_compression 295
16.7 tie 295
16.8 graph_property_iter_range 297
Bibliography 299
Index 303
|
|
|
 |
| 준비 중입니다. |
|
|
|
|
|
|
|
|
|
|
|
|
Home > 
POD(Printed On Demand)
