You can’t really use STV to make an ordered list of which candidates to elect first because STV requires knowing how many candidates will win ahead of time. What you could do is only run STV after the election is over and you know how many seats the party won (or as the link you provided described, recount the STV election for each possible number of winners), but that only works if parties are not required to submit their lists prior to the election and it also means that if a candidate would win a seat under that party’s n winner STV election but not under their n+1 winner election, then a voter might paradoxically prevent a candidate they like from getting elected by voting for that candidate’s party.
The recount STV for each possible number of winners method you linked to would also be … very … time consuming. Considering that STV is already a much more computationally exhausting method then the vast majority of voting methods, having to recount an STV election for each possible number of winners, is alot of work. In a parliament with a 100 seats, that would mean counting 100 different STV elections, and counting just a single STV election gets far more challenging as the number of candidates increases (also, the number of near ties drastically increases as the number of candidates increase in instant runoff voting style methods like STV).
However, you can do this with sequential proportional approval voting. In sequential proportional approval voting, increasing the number of candidates that will be elected can’t change the candidates who were already elected in previous rounds, so you can use sequential proportional approval voting to create a proportional ordered list of all the candidates.