The code, images and designs for this book are released under a Creative Commons Attribution-NonCommercial-ShareAlike 2.5 License. http://creativecommons.org/licenses/by-nc-sa/2.5/ You are free: * to copy, distribute, display, and perf

Floyd-Warshall算法描述 1)适用范围： a)APSP(All Pairs Shortest Paths) b)稠密图效果最佳 c)边权可正可负 2)算法描述： a)初始化：dis[u,v]=w[u,v] b)For k:=1 to n For i:=1 to n For j:=1 to n If dis[i,j]>dis[i,k]+dis[k,j] Then Dis[I,j]:=dis[I,k]+dis[k,j] c)算法结

一维配点型无网格算法matlab程序，以一维单位长度杆为例子。-ONE DIMENSIONAL Collocation-based MESHLESS PROGRAM FOR SOLVING A 1D BAR OF UNIT LENGTH SUBJECTED TO A LINEAR BODY FORCE OF MAGNITUDE X WHOSE EXACT SOLUTION IS GIVEN BY u = (x/2- x^3/6)/E