Improving discrete mathematics and algorithms curricula with LINK

4 June 1997

proceedings article
Published by Association for Computing Machinery (ACM)

Vol. 29 (3) , 14-20
https://doi.org/10.1145/268819.268827

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.

Keywords

EDUCATIONAL TOOL
DISCRETE ALGORITHM
ALGORITHMS CURRICULUM
LINK SYSTEM
EXTENDED EXAMPLE
FUNDAMENTAL GRAPH ALGORITHM
IMPROVING DISCRETE MATHEMATICS
DISCRETE MATHEMATICS
DIRECTED GRAPH
STRONGLY CONNECTED COMPONENT

This publication has 1 reference indexed in Scilit:

LEDA: a platform for combinatorial and geometric computing
Communications of the ACM, 1995