ABSTRACT
In the present chapter, we shall present two algorithms for constructing a braid B by a given link L such that Cl(B) = L and thus prove Alexander’s theorem.
Throughout the present section, we shall work only with oriented links. For any given unoriented link, we choose an arbitrary orientation of it.
