Algorithms in C, Part 5: Graph Algorithms, Third Edition

Index

Abstract transitive closure, 166–167, 208–212

Active vertex, 397

Acyclic graph: see Digraph, Directed acyclic graph (DAG)

Acyclic network, 300–307, 320–321

maxflow, 413–415

Adjacency-lists representation, 27–30

augmenting-paths method, 379

DFS, 84–85, 88, 95–96

digraphs, 31–32, 145, 147, 171

Dijkstra’s algorithm, 284

Euler path, 59

find/remove edge, 34

flow networks, 365–368

performance, 29–30, 32–33, 136–139

PFS, 242

removing vertices, 35

standard adjacency-lists DFS, 90, 153

transitive closure, 166

weighted graphs/networks, 32, 222–226, 266

Adjacency-matrix representation, 21–26

DFS, 81–82, 88

digraphs, 31–32, 145, 147, 161–164, 168, 171

flow networks, 365

linear-time algorithm, 53

performance, 25–26, 32–33, 136, 138

Prim’s algorithm, ...