- shortest path algorithm
-
алгоритм нахождения кратчайшего пути
Англо-русский словарь технических терминов. 2005.
shortest path algorithm
Смотреть что такое "shortest path algorithm" в других словарях:
Shortest path problem — A graph with 6 vertices and 7 edges In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized. An example is… … Wikipedia
Shortest path tree — A shortest path tree, in graph theory, is a subgraph of a given (possibly weighted) graph constructed so that the distance between a selected root node and all other nodes is minimal. It is a tree because if there are two paths between the root… … Wikipedia
shortest-path routing — A routing algorithm in which paths to all network destinations are calculated. The shortest path is then determined by a cost assigned to each link … Dictionary of networking
Edge disjoint shortest pair algorithm — is an algorithm in computer network routing for generating the shortest pair of edge disjoint paths between a given pair of vertices as follows:* Run the shortest pair algorithm for the given pair of vertices * Replace each edge of the shortest… … Wikipedia
Constrained Shortest Path First — (CSPF) is an extension of shortest path algorithms. The path computed using CSPF is a shortest path fulfilling a set of constraints. It simply means that it runs shortest path algorithm after pruning those links that violate a given set of… … Wikipedia
Open Shortest Path First — (OSPF) is an adaptive routing protocol for Internet Protocol (IP) networks. It uses a link state routing algorithm and falls into the group of interior routing protocols, operating within a single autonomous system (AS). It is defined as OSPF… … Wikipedia
All pairs shortest path — Finding all pairs shortest path consists of finding the shortest distance between every pair of nodes in a possibly directed graph. Various means of doing so are known, and the following list gives a few of the common methods: *Floyd Warshall… … Wikipedia
Open Shortest Path First — (frecuentemente abreviado OSPF) es un protocolo de enrutamiento jerárquico de pasarela interior o IGP (Interior Gateway Protocol), que usa el algoritmo Dijkstra enlace estado (LSA Link State Algorithm) para calcular la ruta más corta posible. Usa … Wikipedia Español
Open Shortest Path First — (frecuentemente abreviado OSPF) es un protocolo de encaminamiento jerárquico de pasarela interior o IGP (Interior Gateway Protocol), que usa el algoritmo Dijkstra enlace estado (LSA Link State Algorithm) para calcular la ruta más corta posible.… … Enciclopedia Universal
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Dijkstra's algorithm — Not to be confused with Dykstra s projection algorithm. Dijkstra s algorithm Dijkstra s algorithm runtime Class Search algorithm Data structure Graph Worst case performance … Wikipedia
