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.:)

amitbhat
0
Newbie Poster

## Recommended Answers

Jump to PostNo.

Why don't

youplan out how to do your homework problem, work out the answer, and replymewith the solution; Now.

Jump to PostNo.

Why don't

youplan out how to do your homework problem, work out the answer, and replymewith 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 …

## All 7 Replies

MattEvans
473
Veteran Poster
Team Colleague
Featured Poster

Mushy-pea
36
What, you can change this tag?

amitbhat
0
Newbie Poster

MattEvans
473
Veteran Poster
Team Colleague
Featured Poster

amitbhat
0
Newbie Poster

iamthwee

MattEvans
473
Veteran Poster
Team Colleague
Featured Poster

Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, learning, and sharing knowledge.