single_source_shortest_paths dag_shortest_paths 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 #include "chapter-22/dfs_graph/dfs_graph.h"#include "chapter-22/linked_list_graph/linked_list_graph.h"#include "chapter-24/single_source_shortest_paths/sssp_utilities.h"namespace CLRS { void dag_shortest_paths (LinkedListGraph<SSSPDFSVertexGraph, SSSPWeightEdgeGraph<SSSPDFSVertexGraph>> &g, std::size_t s) { auto l = topological_sort_graph(g); initialize_single_source(g, s); for(std::size_t u : l) { for(const auto &ev : g.get_adj_vertexes(u)) sssp_relax(g, g.edgesr()[ev]); } } } dijkstra 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 #include "chapter-19/fibonacci_heap/fibonacci_heap.

bfs_graph 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 #include "chapter-22/edge_graph/edge_graph.

linked_list_disjoint_set 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 namespace CLRS { template <typename T> classLinkedListDisjointSet; template <typename T> classLinkedListDisjointSetNode; template <typename T> std::shared_ptr<LinkedListDisjointSet<T>> linked_list_disjoint_make_set(const std::shared_ptr <LinkedListDisjointSetNode<T>> &); template <typename T> void linked_list_disjoint_union(const std::shared_ptr <LinkedListDisjointSetNode<T>> &, const std::shared_ptr <LinkedListDisjointSetNode<T>> &); template <typename T> std::shared_ptr<LinkedListDisjointSetNode<T>> linked_list_disjoint_find_set(const std::shared_ptr <LinkedListDisjointSetNode<T>> &); template <typename T> struct LinkedListDisjointSet { using LLDSN = LinkedListDisjointSetNode<T>; using LLDSN_SHR = std::shared_ptr<LLDSN>; LinkedListDisjointSet(const std::shared_ptr <LLDSN> &x): head(x), tail(head), length(1) {} LLDSN_SHR get_head() const {return head;} void set_head(const LLDSN_SHR &p) {head = p;} LLDSN_SHR get_tail() const {return tail;} void set_tail(const LLDSN_SHR &p) {tail = p;} std::size_t get_length() {return length;} void add_length(std::size_t l) {length += l;} private: LLDSN_SHR head; LLDSN_SHR tail; std::size_t length = 0; }; template <typename T> struct LinkedListDisjointSetNode { using LLDS = LinkedListDisjointSet<T>; using LLDSN = LinkedListDisjointSetNode; using LLDS_SHR = std::shared_ptr<LLDS>; using LLDSN_SHR = std::shared_ptr<LLDSN>; LinkedListDisjointSetNode(T x): key(x) {} T get_key() const {return key;} LLDS_SHR get_set_p() const {return set_p;} void set_set_p(const LLDS_SHR &p) {set_p = p;} LLDSN_SHR get_next() {return next;} void set_next(const LLDSN_SHR &n) {next = n;} private: T key; LLDS_SHR set_p; LLDSN_SHR next; }; template <typename T> std::shared_ptr<LinkedListDisjointSet<T>> linked_list_disjoint_make_set(const std::shared_ptr <LinkedListDisjointSetNode<T>> &x) { auto set = std::make_shared<LinkedListDisjointSet<T>>(x); x->set_set_p(set); return set; } template <typename T> void linked_list_disjoint_union(const std::shared_ptr <LinkedListDisjointSetNode<T>> &x, const std::shared_ptr <LinkedListDisjointSetNode<T>> &y) { auto x_set_p = x->get_set_p(); std::size_t x_set_len = x_set_p->get_length(); auto y_set_p = y->get_set_p(); std::size_t y_set_len = y_set_p->get_length(); if(x_set_len <= y_set_len) { auto x_head = x_set_p->get_head(); auto x_tail = x_set_p->get_tail(); // update the set_p data member of objects in linked list for(auto shr = x_head; shr !

proto_veb_tree 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 #include "chapter-20/veb_tree_utilities.

fibonacci_heap 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 namespace CLRS { template <typename T> classFibHeap; template <typename T> classFibHeapTreeNode; template <typename T> FibHeap<T> make_fib_heap(); template <typename T> void fib_heap_insert(const FibHeap<T> &, const std::shared_ptr<FibHeapTreeNode<T>> &); template <typename T> std::shared_ptr<FibHeapTreeNode<T>> fib_heap_minimum(const FibHeap<T> &); template <typename T> FibHeap<T> fib_heap_union(const FibHeap<T> &, const FibHeap<T> &); template <typename T> std::shared_ptr<FibHeapTreeNode<T>> fib_heap_extract_min(FibHeap<T> &); template <typename T> void consolidate(FibHeap<T> &); template <typename T> void fib_heap_link(const FibHeap<T> &, const std::shared_ptr<FibHeapTreeNode<T>> &, const std::shared_ptr<FibHeapTreeNode<T>> &); template <typename T> void fib_heap_decrease_key(FibHeap<T> &, const std::shared_ptr<FibHeapTreeNode<T>> &, T); template <typename T> void cut(const FibHeap<T> &, const std::shared_ptr<FibHeapTreeNode<T>> &, const std::shared_ptr<FibHeapTreeNode<T>> &); template <typename T> void cascading_cut(const FibHeap<T> &, const std::shared_ptr<FibHeapTreeNode<T>> &); template <typename T> void fib_heap_delete(FibHeap<T> &, const std::shared_ptr<FibHeapTreeNode<T>> &); /* * doubly linked circular list helper functions */ // just assign itself to the left and right of node.