530 likes | 577 Views
Chapter 9 Network Models. Shortest-Route ProblemMinimal Spanning Tree ProblemMaximal Flow Problem. Computer Codes. Computer codes for specific network problems (e.g. shortest route, minimal spanning tree, and maximal flow) are extremely efficient and can solve even large problems relatively quick
E N D