Busacker-Gowen algorithm
preferred label: الگوریتم باسکر-گوئن @fa
type: Concept
related: shortest path algorithm

graph algorithms
preferred label: الگوریتم‌های گراف @fa
type: Concept
narrower: shortest path algorithm

distance matrix
preferred label: ماتریس فاصله @fa
type: Concept
related: shortest path algorithm

chinese postman problem
preferred label: مسئله پستچی چینی @fa
type: Concept
related: shortest path algorithm

median graph
preferred label: گراف میانه @fa
type: Concept
related: shortest path algorithm

shortest path algorithm
related: successive shortest path algorithm
related: Busacker-Gowen algorithm
related: median graph
related: Dijkstra algorithm
related: Klein algorithm
related: chinese postman problem
related: Ford-Fulkerson algorithm
related: shortest path problem
related: distance matrix
related: Bellman-Ford algorithm
related: dynamic programming
related: compound transshipment problem
preferred label: الگوریتم کوتاهترین مسیر @fa
broader: graph algorithms
type: Concept

Dijkstra algorithm
preferred label: الگوریتم دیجسترا @fa
type: Concept
related: shortest path algorithm

shortest path problem
preferred label: مسئله کوتاهترین مسیر @fa
type: Concept
related: shortest path algorithm

compound transshipment problem
preferred label: مسئله حمل و نقل مرکب @fa
type: Concept
related: shortest path algorithm

Klein algorithm
preferred label: الگوریتم کلاین @fa
type: Concept
related: shortest path algorithm

Bellman-Ford algorithm
preferred label: الگوریتم بلمن-فورد @fa
type: Concept
related: shortest path algorithm

Ford-Fulkerson algorithm
preferred label: الگوریتم فورد-فولکرسون @fa
type: Concept
related: shortest path algorithm

dynamic programming
preferred label: برنامه‌ریزی دینامیک @fa
type: Concept
related: shortest path algorithm

successive shortest path algorithm
preferred label: الگوریتم کوتاهترین مسیر متوالی @fa
type: Concept
related: shortest path algorithm