void doinit() { /* initializes variables */ inputnumbers2(&spp, &nonodes2, 1); if (inputnumbers2error) return; nonodes2--; alloctree(&curtree.nodep, nonodes2); allocd(nonodes2, curtree.nodep); allocw(nonodes2, curtree.nodep); alloctree(&bestree.nodep, nonodes2); allocd(nonodes2, bestree.nodep); allocw(nonodes2, bestree.nodep); alloctree(&priortree.nodep, nonodes2); allocd(nonodes2, priortree.nodep); allocw(nonodes2, priortree.nodep); if (njumble > 1) { alloctree(&bestree2.nodep, nonodes2); allocd(nonodes2, bestree2.nodep); allocw(nonodes2, bestree2.nodep); } allocrest(); } /* doinit */
void doinit() { /* initializes variables */ inputnumbers2(&spp, &nonodes2, 1); getoptions(); if ( !usertree ) nonodes2--; alloctree(&curtree.nodep, nonodes2); allocd(nonodes2, curtree.nodep); allocw(nonodes2, curtree.nodep); if (!usertree) { alloctree(&bestree.nodep, nonodes2); allocd(nonodes2, bestree.nodep); allocw(nonodes2, bestree.nodep); alloctree(&priortree.nodep, nonodes2); allocd(nonodes2, priortree.nodep); allocw(nonodes2, priortree.nodep); if (njumble > 1) { alloctree(&bestree2.nodep, nonodes2); allocd(nonodes2, bestree2.nodep); allocw(nonodes2, bestree2.nodep); } } allocrest(); } /* doinit */
void doinit() { /* initializes variables */ node *p; inputnumbers2(&spp, &nonodes2, 2); nonodes2 += (njoin ? 0 : 1); getoptions(); alloctree(&curtree.nodep, nonodes2+1); p = curtree.nodep[nonodes2]->next->next; curtree.nodep[nonodes2]->next = curtree.nodep[nonodes2]; free(p); allocrest(); } /* doinit */