Improving discrete mathematics and algorithms curricula with LINK

Abstract

This paper introduces the LINK system as an educational tool which can be used to visualize and experiment with discrete algorithms. An extended example demonstrates the flexibility of the system in the context of a fundamental graph algorithm: finding the strongly connected components of a directed graph.