اصطلاح مرجح
graph algorithms
نوع
-
http://www.irandoc.ac.ir/onto/irandoc-meta/Concept
مفهوم اعم
مفهومهای اخص
- algorithm for articulation point
- Bellman-Ford algorithm
- computing of block algorithm
- Dijkstra algorithm
- directed Eulerian circuit algorithm
- Fleury algorithm
- Ford-Fulkerson algorithm
- greedy algorithm
- hill climbing algorithm
- hungarian algorithm
- Kruskal algorithm
- MDST algorithm
- planarity algorithm
- Prim algorithm
- shortest path algorithm
- Sulin algorithm
مفهومهای وابسته
در زبان های دیگر
الگوریتمهای گراف
Persian
URI
http://www.irandoc.acir/onto/irandoc/MAT0002776