Trudgintr Posted November 20, 2018 Report Share Posted November 20, 2018 I have been exploring the chinese postman problem, and I'm really worried that it's too simple/there aren't enough mathematics involved. I explained the problem, gave a couple of examples, but there isn't much calculus/numerical calculations. In general, it only really consists of graph theory. My teacher recommended that I add in permutations, maybe probability, but I have little to no idea how I can accomplish that. I was considering using permutations to explore how many directed graphs can be made of the undirected graph; however, this has been classified as np-hard and is likely a dead-end. I also considered using pascal's grid to find the pathways, but CPP requires the return to the initial vertice, so that is not possible. Do you guys have any idea how I could include more math in my IA? Reply Link to post Share on other sites More sharing options...
Recommended Posts
Join the conversation
You can post now and register later. If you have an account, sign in now to post with your account.