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

Index

Abstract transitive closure, 174–175, 216–220

Active vertex, 411

Acyclic graph. see Digraph; Directed acyclic graph (DAG)

Acyclic network, 313–321, 334–335

maxflow, 427–429

Adjacency-lists representation, 31–35

DFS, 90, 95, 102

digraphs, 36–37, 153, 155, 179

edge connectivity, 115–116

find/remove edge, 40

flow networks, 379

performance, 33–35, 37–40, 145–146

removing vertices, 41

standard adjacency-lists DFS, 97, 161

transitive closure, 174

weighted graphs/networks, 37, 230, 235–238, 278

Adjacency-matrix representation, 25–30

DFS, 90, 95, 101

digraphs, 36–37, 153, 154–155, 169–172, 176, 179

flow networks, 379

linear-time algorithm, 59

performance, 29–30, 37–40, 144–146

removing vertices, 41

standard adjacency-matrix DFS, 97, 161

weighted ...