A Classic Algorithm That Calculates a Least-Cost Path Through a Network

question 100

Multiple Choice

A classic algorithm that calculates a least-cost path through a network is ____ algorithm.

• A) Dijkstra's maximum-cost
• B) Dijkstra's longest-path
• C) Turing's longest-path
• D) Dijkstra's least-cost

---

Definitions:

Negative Punishment

A behavior modification technique involving the removal of a desirable stimulus following an undesired behavior to decrease the likelihood of the behavior’s occurrence.

Positive Punishment

Adding an unpleasant stimulus to decrease a behavior, part of operant conditioning in psychology.

Operant Responding

A form of learning where behavior is modified by its consequences, such as rewards or punishments.

Operant Responding

A process in behavior analysis, emphasizing the influence of consequences on subsequent behavior.