Use related theories or methods in discrete mathematics to model and solve a specific problem in computer science that is Using graph theories to find the shortest path between computer network nodes. Requirements: 1) Upload/submit your final report (pdf vers ion) 2) Absolutely do not plagiarize, otherwise y our score may be zero; 3) No less than 1500 words, report is well st ructured and well-formed; 4) Describe the problem and the process of modeling the problem in detail; 5) Describe the design of algorithm and your possible codes in detail; 6) Include some ideas for further improvem ents to solve above problem and your experience of learning this course.

Use related theories or methods in discrete mathematics to model and solve a specific problem in computer science that is Using graph theories to find the shortest path between computer network nodes. Requirements: 1) Upload/submit your final report (pdf vers ion); 2) Absolutely do not plagiarize, otherwise y our score may be zero; 3) No less than 1500 words, report is well st ructured and well-formed; 4) Describe the problem and the process of modeling the problem in detail; 5) Describe the design of algorithm and your possible codes in detail; 6) Include some ideas for further improvem ents to solve above problem and your experience of learning this course