Home > Term: Chinese postman problem
Chinese postman problem
Find a minimum length closed walk that traverses each edge at least once. Finding an optimal solution in a graph with both directed and undirected edges is NP-complete.
- ส่วนหนึ่งของคำพูด: noun
- อุตสาหกรรม/ขอบเขต: Computer science
- Category: Algorithms & data structures
- Government Agency: NIST
0
ผู้สร้าง
- GeorgeV
- 100% positive feedback