In this paper, a new and efficient tree-enumeration method (the cutting method) is presented to generate network functions in all symbolic forms for a general linear network. This method, based on the idea of graph partitioning, has all the main advantage