4634
правки
Chinese postman's problem: различия между версиями
Материал из WikiGrapp
нет описания правки
Glk (обсуждение | вклад) (Новая страница: «'''Chinese postman's problem''' --- задача китайского почтальона. Let <math>G = (V,E)</math> be a connected undirected graph. A non-nega…») |
KEV (обсуждение | вклад) Нет описания правки |
||
| Строка 1: | Строка 1: | ||
'''Chinese postman's problem''' | '''Chinese postman's problem''' — [[задача китайского почтальона]]. | ||
Let <math>G = (V,E)</math> be a connected undirected graph. A non-negative cost (or length) is | Let <math>G = (V,E)</math> be a [[connected graph|connected]] [[graph, undirected graph, nonoriented graph|undirected graph]]. A non-negative cost (or length) is | ||
associated with each edge of <math>G</math>. The '''Chinese postman's problem''' consists in | associated with each [[edge]] of <math>G</math>. The '''Chinese postman's problem''' consists in | ||
determining a least-cost ''traversal'' of <math>G</math>. | determining a least-cost ''traversal'' of <math>G</math>. | ||
==Литература== | |||
* Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009. | |||
