{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

9_split_Introduction to Algorithms 2nd Edition

# 9_split_Introduction to Algorithms 2nd Edition -...

This preview shows page 1. Sign up to view the full content.

viii Contents V Advanced Data Structures Introduction 431 18 B-Trees 434 18.1 Definition of B-trees 438 18.2 Basic operations on B-trees 441 18.3 Deleting a key from a B-tree 449 19 Binomial Heaps 455 19.1 Binomial trees and binomial heaps 457 19.2 Operations on binomial heaps 461 20 Fibonacci Heaps 476 20.1 Structure of Fibonacci heaps 477 20.2 Mergeable-heap operations 479 20.3 Decreasing a key and deleting a node 489 20.4 Bounding the maximum degree 493 21 Data Structures for Disjoint Sets 498 21.1 Disjoint-set operations 498 21.2 Linked-list representation of disjoint sets 501 21.3 Disjoint-set forests 505 21.4 Analysis of union by rank with path compression 509 VI Graph Algorithms Introduction
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Introduction 525 22 Elementary Graph Algorithms 527 22.1 Representations of graphs 527 22.2 Breadth-ﬁrst search 531 22.3 Depth-ﬁrst search 540 22.4 Topological sort 549 22.5 Strongly connected components 552 23 Minimum Spanning Trees 561 23.1 Growing a minimum spanning tree 562 23.2 The algorithms of Kruskal and Prim 567 24 Single-Source Shortest Paths 580 24.1 The Bellman-Ford algorithm 588 24.2 Single-source shortest paths in directed acyclic graphs 592 24.3 Dijkstra’s algorithm 595 24.4 Difference constraints and shortest paths 601 24.5 Proofs of shortest-paths properties 607...
View Full Document

{[ snackBarMessage ]}