Friday, 4 September 2009
Traversing networks: the nth-nearest neighbor
The F#.NET Journal just published an article about dynamic programming:
"Graph theory has a great many practical applications ranging from compiler internals to the study of the structural characteristics of materials. This article describes the design and implementation of a program that finds the nth-nearest neighbors of a given vertex in an infinite graph. This problem is of interest in the context of atomic structures..."
To read this article and more, subscribe to The F#.NET Journal today!
Subscribe to Posts [Atom]