Outrageously Funny Word Dictionary :: Feists

👉 In the context of computer science, a "feist" is an algorithm or procedure used to find a minimum spanning tree (MST) in a graph. A MST is a tree that connects all vertices with minimal possible weight. Fei's algorithm is one such algorithm for finding the MST in a graph. The main idea behind this algorithm is to use the minimum number of edges possible to connect every pair of vertices and then remove these edges, until only one edge remains. This process is

feists