Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Thistlethwaite and Hoste's program Knotscape will turn a combinatorial description of any knot diagram (Dowker notation) into a planar picture, which can then be turned into a 3d parameterization a la Dlugie's comment. I don't remember if it can handle links.
Milnor's $\mu$ invariants are among the easiest ways to show nontriviality of a given Brunnian link but you can also pick your favorite link invariant like the Jones Polynomial and try calculating that. For mu invariants, Cochran's derived link calculus is pretty efficient in practice.