Home > Term: single-destination shortest-path problem
single-destination shortest-path problem
Find the shortest path from each vertex in a weighted, directed graph to a specific destination vertex.
- ส่วนหนึ่งของคำพูด: noun
- อุตสาหกรรม/ขอบเขต: Computer science
- Category: Algorithms & data structures
- Government Agency: NIST
0
ผู้สร้าง
- GeorgeV
- 100% positive feedback