读取文件中经纬度计算两节点间的实际距离

#include <stdio.h>
#include <string.h>
#include <math.h>

#define MAX_NODES 100
#define DBL_MAX 1.7976931348623158e+308 /* From <float.h> */

// 结构表示节点
struct Node {
    char name[50];  // 节点名称
    double lat;
    double lon;
};

// 定义用于计算两个经纬度点之间距离的函数
double calculateDistance(double lat1, double lon1, double lat2, double lon2) {
    double radianLat1 = lat1 * M_PI / 180.0;
    double radianLon1 = lon1 * M_PI / 180.0;
    double radianLat2 = lat2 * M_PI / 180.0;
    double radianLon2 = lon2 * M_PI / 180.0;

    double deltaLat = radianLat2 - radianLat1;
    double deltaLon = radianLon2 - radianLon1;

    double a = sin(deltaLat / 2.0) * sin(deltaLat / 2.0) + cos(radianLat1) * cos(radianLat2) * sin(deltaLon / 2.0) * sin(deltaLon / 2.0);
    double c = 2 * atan2(sqrt(a), sqrt(1 - a));

    // 地球半径（单位：千米）
    double radius = 6371.0;

    return radius * c;
}

int main() {
    int numNodes = 0;
    struct Node nodes[MAX_NODES];

    // 读取CSV文件
    FILE *file = fopen("lu.csv", "r");
    if (file == NULL) {
        perror("Error opening file");
        return 1;
    }

    char line[1000];
    while (fgets(line, sizeof(line), file) != NULL) {
        // 解析CSV行数据
        char name[50];
        double lat, lon;

        // 解析节点数据
        if (sscanf(line, "%s %lf %lf", name, &lat, &lon) == 3) {
            strncpy(nodes[numNodes].name, name, sizeof(nodes[numNodes].name));
            nodes[numNodes].lat = lat;
            nodes[numNodes].lon = lon;
            numNodes++;
        }
    }

    // 关闭文件
    fclose(file);

    // 用户输入两个节点的名称
    char nodeName1[50], nodeName2[50];
    printf("Enter the names of the first and second nodes: ");
    scanf("%s %s", nodeName1, nodeName2);

    // 查找用户输入的两个节点的经纬度
    double lat1 = 0.0, lon1 = 0.0, lat2 = 0.0, lon2 = 0.0;
    int node1Found = 0, node2Found = 0;

    for (int i = 0; i < numNodes; i++) {
        if (strcmp(nodes[i].name, nodeName1) == 0) {
            lat1 = nodes[i].lat;
            lon1 = nodes[i].lon;
            node1Found = 1;
        }
        if (strcmp(nodes[i].name, nodeName2) == 0) {
            lat2 = nodes[i].lat;
            lon2 = nodes[i].lon;
            node2Found = 1;
        }

        if (node1Found && node2Found) {
            break; // 找到了两个节点就退出循环
        }
    }

    if (node1Found && node2Found) {
        // 计算最短距离
        double shortestDistance = calculateDistance(lat1, lon1, lat2, lon2);

        // 输出结果
        printf("Distance between Node %s and Node %s: %.2lf km\n", nodeName1, nodeName2, shortestDistance);
    } else {
        printf("One or both nodes not found in the dataset.\n");
    }

    return 0;
}

注意:读取文档的编号和经纬度格式要与代码中读取格式一致。