SFLA algorithms are algorithms for solving combinatorial optimization problems. It is based on the heuristic method of the Collections class to study this SFLA initialization on a virtual collection of frogs, jumping in the pond, searching for optimal food locations. Frogs can be seen as thinking subjects. A thinking can be seen as a




File list:
sfla
...\debug
...\.....\sfla.exe
...\.....\sfla.ilk
...\.....\sfla.pdb
...\sfla
...\....\Debug
...\....\.....\BuildLog.htm
...\....\.....\mt.dep
...\....\.....\sfla.exe.embed.manifest
...\....\.....\sfla.exe.embed.manifest.res
...\....\.....\sfla.exe.intermediate.manifest
...\....\.....\SFLA.obj
...\....\.....\vc80.idb
...\....\.....\vc80.pdb
...\....\result.txt
...\....\SFLA.cpp
...\....\sfla.vcproj
...\....\sfla.vcproj.YANGFEI-25B63F6.namespace.user
...\sfla.ncb
...\sfla.sln
...\sfla.suo
程序说明.txt