944,092 Members | Top Members by Rank

Ad:
Jan 16th, 2007
0

chinese post man problem

Expand Post »
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.
Similar Threads
Reputation Points: 10
Solved Threads: 0
Newbie Poster
amitbhat is offline Offline
5 posts
since Jan 2007
Jan 16th, 2007
0

Re: chinese post man problem

No.

Why don't you plan out how to do your homework problem, work out the answer, and reply me with the solution; Now.
Last edited by MattEvans; Jan 16th, 2007 at 12:07 pm. Reason: I shouldn't speak for humanity; only for myself.
Moderator
Featured Poster
Reputation Points: 522
Solved Threads: 64
Veteran Poster
MattEvans is offline Offline
1,091 posts
since Jul 2006
Jan 16th, 2007
0

Re: chinese post man problem

Click to Expand / Collapse  Quote originally posted by MattEvans ...
No.

Why don't you plan out how to do your homework problem, work out the answer, and reply me with the solution; Now.
:lol:

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.
Reputation Points: 47
Solved Threads: 1
Posting Whiz in Training
Mushy-pea is offline Offline
271 posts
since Jun 2006
Jan 18th, 2007
0

Re: chinese post man problem

hey thanks for the reponses...
any way this is not my homw work. i got it in the webaite , but cud not get the rite solution. so thought of asking u ppl. any way i am working on it. once i get it , i ll post it here. In meanwhile , if somebody has any idea, do inform me.
Reputation Points: 10
Solved Threads: 0
Newbie Poster
amitbhat is offline Offline
5 posts
since Jan 2007
Jan 18th, 2007
0

Re: chinese post man problem

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?
Moderator
Featured Poster
Reputation Points: 522
Solved Threads: 64
Veteran Poster
MattEvans is offline Offline
1,091 posts
since Jul 2006
Jan 19th, 2007
0

Re: chinese post man problem

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.
Reputation Points: 10
Solved Threads: 0
Newbie Poster
amitbhat is offline Offline
5 posts
since Jan 2007
Jan 20th, 2007
0

Re: chinese post man problem

Featured Poster
Reputation Points: 1536
Solved Threads: 431
Posting Expert
iamthwee is offline Offline
5,865 posts
since Aug 2005
Jan 20th, 2007
0

Re: chinese post man problem

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 ^_-
Moderator
Featured Poster
Reputation Points: 522
Solved Threads: 64
Veteran Poster
MattEvans is offline Offline
1,091 posts
since Jul 2006

This thread is more than three months old

No one has posted to this discussion for at least three months. Please let old threads die and do not reply to them unless you feel you have something new and valuable to contribute that absolutely must be added to make the discussion complete. Otherwise, please start a new thread in this forum instead.
Message:
Previous Thread in IT Professionals' Lounge Forum Timeline: how many macs?
Next Thread in IT Professionals' Lounge Forum Timeline: Computer Purchase





About Us | Contact Us | Advertise | Acceptable Use Policy
Forum Index | Build Custom RSS Feed


Follow us on Twitter


© 2011 DaniWeb® LLC