Dijkstra's algorithm and weight restrictions

Knowledge package outline

Topic

Computation and software foundations

Purpose

Shows why a shortest-path method needs nonnegative edges.

Package contents

Relaxation tables; priority queues; negative-edge failure.

Dependencies

Graphs; heaps.