Elaslic-finite-finite

最短路Dijkstra算法，matlab编写的(Dijkstra shortest path algorithm, prepared by the Matlab)

可以用黄金分割和斐波那契算法实现优化,只要改变相应的参数就可以用了(You can use the golden section and the Fibonacci algorithm to optimize, just change the corresponding parameters.)

追敢法,主要是n阶线形方程组Ax b的列主元高斯消去法的一个特殊情况,为上三角矩阵,通用程序如附件所示()

说明：  深入理解Spark核心技术书籍，书籍对spark进行了深入讲解，并对spark源码进行了剖析(In-depth understanding of Spark core technology books, books on Spark in-depth explanation, and analysis of spark source code)

spring boot 和spark嵌套的demo(spring boot join with spark)

An article about how in matlab of pso algorithm in the paper, so as to realize optimization to solve,,

ap聚类算法实现三维数据点的分类，demo为案例(AP clustering algorithm realizes the classification of data points, demo as a case.)

利用宽度有限方法（BFS）寻找最短路径和最小树的算法和算例。(Use of finite width method (BFS) to find the shortest path and minimum tree algorithms and numerical examples.)

数据挖掘中的binning算法，用于数据预处理(Binning algorithm in data mining for data preprocessing)

一种特征提取方法：结合主元分析(PCA)和核主元分析（KPCA）的前馈神经网络（FNN）(A feature extraction method: the feedforward neural network (FNN) combined with principal component analysis (PCA) and kernel principal component analysis (KPCA))