| | |
chinese post man problem
![]() |
•
•
Join Date: Jan 2007
Posts: 5
Reputation:
Solved Threads: 0
Hi, everyone must be aware of chinese post man problem.
decription is as follows:
Postmen deliver letters down roads. The Chinese Postman Problem is to find the shortest route in a network that uses every arc (directed edge) and gets back to where they started (closed problem) or doesn't go back (open problem). There are many further variations on the problem, but we are concerned with weighted directed graphs with (possible) parallel arcs, so-called weighted multidigraphs -- what the world wide web is made out of from its HTML links, which are directed and may be repeated. We allow weights because we might, for example, be interested in how long a user takes to explore a web site, so the weights could be measured in seconds. main intention is to get the code to find the solution ..
Please reply me now with a solution.
decription is as follows:
Postmen deliver letters down roads. The Chinese Postman Problem is to find the shortest route in a network that uses every arc (directed edge) and gets back to where they started (closed problem) or doesn't go back (open problem). There are many further variations on the problem, but we are concerned with weighted directed graphs with (possible) parallel arcs, so-called weighted multidigraphs -- what the world wide web is made out of from its HTML links, which are directed and may be repeated. We allow weights because we might, for example, be interested in how long a user takes to explore a web site, so the weights could be measured in seconds. main intention is to get the code to find the solution ..
Please reply me now with a solution.
•
•
•
•
No.
Why don't you plan out how to do your homework problem, work out the answer, and reply me with the solution; Now.
The solution may lie in the field of "scale free networks" rather than Chinese postmen. If you have a specific question about a coding problem there are several forums on this site for such queries. But the same applies as Matt said, it is you who needs to tell us the answer. Preferably, now. Good luck.
Steven.
Last edited by Mushy-pea; Jan 16th, 2007 at 8:02 pm.
The one question you should not ask when teaching a new language structure is "Do you understand?". Do you understand?
Well. I apologise for my terseness in that post; but only if you're generally interested in this problem for entertainment, and not just after a quick answer.
There is no solution to the question, (partly because there's also no real question in your post).
If you want to model a complex system, the best place to start is planning. If you draw some diagrams, and work out the "answer" for those diagrams, perhaps it will help you to get closer to a reusable algorithm.
There's going to be an enourmous element of chance in "how long a user takes to explore a web site". Perhaps a better value to find is the maximum or minimum time it takes a user to explore a website.
Even then, the model will either have to be very comprehensive (with each page accounted for) or very vague (using averages/predictions).
I've had a little look at this tonight... There's always gonna be a huge number of solutions, and a huge number of questions.
Perhaps I'll reply my findings aswell at some point...
Is this one of those questions that's baffled mathematicians eternally?
There is no solution to the question, (partly because there's also no real question in your post).
If you want to model a complex system, the best place to start is planning. If you draw some diagrams, and work out the "answer" for those diagrams, perhaps it will help you to get closer to a reusable algorithm.
There's going to be an enourmous element of chance in "how long a user takes to explore a web site". Perhaps a better value to find is the maximum or minimum time it takes a user to explore a website.
Even then, the model will either have to be very comprehensive (with each page accounted for) or very vague (using averages/predictions).
I've had a little look at this tonight... There's always gonna be a huge number of solutions, and a huge number of questions.
Perhaps I'll reply my findings aswell at some point...
Is this one of those questions that's baffled mathematicians eternally?
Plato forgot the nullahedron..
•
•
Join Date: Jan 2007
Posts: 5
Reputation:
Solved Threads: 0
hi
i am working on that. I find it very difficult to go to a particular point in web. anyway thanks for having interest in this problem. i admit that there was no clear specification of problem, since i had out it generally.
this may be the example wer specification not directing to a good solution.
i am working on that. I find it very difficult to go to a particular point in web. anyway thanks for having interest in this problem. i admit that there was no clear specification of problem, since i had out it generally.
this may be the example wer specification not directing to a good solution.
That's quite comprehensive; but it doesn't cover the website situation well; because a user doesn't neccessarily have a sitemap in their head but links do usually have informative titles... =P To make it accurate for a website; you need a per-path constant of 'link naming sensibility', and per traverser constants of 'link name interpretation' and 'memory', infact link name interpretation should increase as the traverser explores the site, assuming that they have a good memory.
And hey, you do realise you have to implement human nature to get it truely accurate ^_-
And hey, you do realise you have to implement human nature to get it truely accurate ^_-
Plato forgot the nullahedron..
![]() |
Similar Threads
- Big time freezing problem in WinXP (Windows NT / 2000 / XP)
- hijackthis post, aurora problem,winpatrol exe.r files, yikes (Viruses, Spyware and other Nasties)
Other Threads in the IT Professionals' Lounge Forum
- Previous Thread: how many macs?
- Next Thread: Computer Purchase
| Thread Tools | Search this Thread |
1gbit advertising advice amazon answers archive british broadband business businessprocesses career carrier censorship cern china cio collectiveintelligence connectivity consumer consumers corporateearnings datatransfer debtcollectors dictionary digg digital ebay ecommerce email employment environment facebook food government grid high-definition hottub infodelivery infotech intel internet interview ipod isp japan kindle lhc library malware marketing mit moonfruit news onlineshopping piracy piratebay pope porn program questions r&d religion remoteworking research retail security sex shopping simple skype smallbusiness smb sms socialmedia socialnetworking software softwareengineer spam speed spending startrek statistics stocks study stumbleupon survey tabletpc technology touch-screen touchscreen twitter uk videoinprint voips web webdeveloper windows words






