Ford-Fulkerson algorithm
[ford ˈfʊlkərsən ˈælɡərɪðəm]
nounpl: Ford-Fulkerson algorithms
algoritmo de Ford-Fulkerson
1. A greedy algorithm that computes the maximum flow in a flow network by repeatedly finding augmenting paths from source to sink and updating residual capacities until no more augmenting paths exist.
The Ford-Fulkerson algorithm is fundamental in solving network flow problems in computer science.
O algoritmo de Ford-Fulkerson é fundamental para resolver problemas de fluxo em rede em ciência da computação.
2. An iterative method named after L. R. Ford Jr. and D. R. Fulkerson that finds the maximum amount of flow that can pass through a network from a source node to a sink node.
Engineers use the Ford-Fulkerson algorithm to optimize traffic flow in transportation networks.
Engenheiros utilizam o algoritmo de Ford-Fulkerson para otimizar o fluxo de tráfego em redes de transporte.
The Ford-Fulkerson algorithm is a cornerstone concept in computer science curricula worldwide, taught in both Brazil and the USA in courses on algorithms and graph theory. It represents a foundational American contribution to algorithmic theory developed in the 1950s-1960s, and its name is preserved identically in Portuguese-speaking academic contexts, reflecting the universal nature of scientific nomenclature in mathematics and computer science.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →