How to create Laguerre method with a strategy for reducing polynomial and polishing?

I want to create program with compute equations like 243z^7 - 486z^6 + 783z^5 - 990z^4 + 558z^3 - 28z^2 - 72z + 16 = 0 or similar using Laguerre method in c++.
But I don't know how to start and I can't find any proper information about it in c++ using complex numbers.

Does anyone know any good sources or have a code to share with? In the worst case, it can be java but I want avoid using R and python.