# RFC 05: [open] Implementation of “Chinese postman problem (CPP)” algorithm¶

Date: | 2010/11/22 |

Author: | Daniel Kastl |

Contact: | daniel at georepublic.de |

Last Edited: | 2010/11/22 |

Status: | Draft (xxxx/xx/xx) |

## Overview¶

In graph theory, a branch of mathematics, the Chinese postman problem (CPP), postman tour or route inspection problem is to find a shortest closed path or circuit that visits every edge of a (connected) undirected graph. When the graph has an Eulerian circuit (a closed walk that covers every edge once), that circuit is an optimal solution.

Alan Goldman of the U.S. National Bureau of Standards first coined the name ‘Chinese Postman Problem’ for this problem, as it was originally studied by the Chinese mathematician Mei-Ku Kuan in 1962.

[Source: http://en.wikipedia.org/wiki/Route_inspection_problem]

## Implementation Details¶

List of online resources:

## Backwards Compatibilty Issues¶

Are not expected

## Documentation¶

Required.

## Ticket ID¶

Not assigned.

## Voting History¶

No vote yet.