This paper provides a method for finding the optimal expansion process of t
he competence set in generalized situations in which the cost functions are
asymmetric and the directed graphs, which depict all possible expansion pr
ocesses, have cycles and contain intermediate skills and compound nodes.