Search - simulation of dijkstra algorithm in c

Search - simulation of dijkstra algorithm in c - List

[Data structs] Dijkstra DL : 0: 单源最短路径问题：给定带权有向图G=(V,E)。给定V中的一个顶点v，称为源。要计算从源到所有其它各顶点的最短路径长度。-Single-source shortest path problem: a given weighted directed graph G = (V, E). Given a vertex V in v, known as the source. To calculate from the source to all other vertices of the shortest path length.
Update : 2025-02-17 Size : 1kb Publisher : 忠波
[Windows Develop] Gaussian-with--Anisotropy- DL : 0: C++与FORTRAN混编程序。考虑各向异性的克里金法及序贯高斯法。在地质，油藏建模中很有用处 Author--Jeff Boisvert and Clayton V. Deutsch-for incorporating locally varying anisotropy in kriging or sequential Gaussian simulation is based on modifying how locations in space are related. Normally, the straight line path is used however, when nonlinear features exist the appropriate path between locations follows along the features. The Dijkstra algorithm is used to determine the shortest path/distance between locations and a conventional covariance or variogram function is used. This nonlinear path is a non-Euclidean distance metric and positive definiteness of the resulting kriging system of equations is not guaranteed. Multidimensional scaling (landmark isometric mapping) is used to ensure positive definiteness.
Update : 2025-02-17 Size : 457kb Publisher : 张开