用C语言写一个aoe网络的关键路径的代码

以下是用 C 语言实现 AOE 网络的关键路径算法的示例代码：

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <limits.h>

// 定义任务节点结构体
typedef struct task {
    char name;
    int duration;
    int earliest_start_time;
    int latest_start_time;
    int float_time;
    struct task **dependencies;
} Task;

// 定义任务节点指针类型
typedef Task* TaskPtr;

// 计算关键路径
void calc_critical_path(TaskPtr start_node, TaskPtr end_node) {
    // 计算每个节点的最早开始时间
    TaskPtr curr_node = start_node;
    while (curr_node != NULL) {
        curr_node->earliest_start_time = 0;
        for (int i = 0; curr_node->dependencies[i] != NULL; i++) {
            TaskPtr dep_node = curr_node->dependencies[i];
            curr_node->earliest_start_time = curr_node->earliest_start_time > dep_node->earliest_start_time + dep_node->duration ? curr_node->earliest_start_time : dep_node->earliest_start_time + dep_node->duration;
        }
        curr_node = curr_node->dependencies[0];
    }

    // 计算每个节点的最晚开始时间
    curr_node = end_node;
    while (curr_node != NULL) {
        curr_node->latest_start_time = INT_MAX;
        for (int i = 0; curr_node->dependencies[i] != NULL; i++) {
            TaskPtr dep_node = curr_node->dependencies[i];
            curr_node->latest_start_time = curr_node->latest_start_time < dep_node->latest_start_time - dep_node->duration ? curr_node->latest_start_time : dep_node->latest_start_time - dep_node->duration;
        }
        curr_node = curr_node->dependencies[0];
    }

    // 计算每个任务的浮动时间
    curr_node = start_node;
    while (curr_node != NULL) {
        curr_node->float_time = curr_node->latest_start_time - curr_node->earliest_start_time;
        curr_node = curr_node->dependencies[0];
    }

    // 找到关键路径上的任务
    curr_node = start_node;
    while (curr_node != NULL) {
        printf("%c ", curr_node->name);
        TaskPtr next_node = NULL;
        for (int i = 0; curr_node->dependencies[i] != NULL; i++) {
            TaskPtr dep_node = curr_node->dependencies[i];
            if (dep_node->float_time == 0 && (next_node == NULL || dep_node->earliest_start_time < next_node->earliest_start_time)) {
                next_node = dep_node;
            }
        }
        curr_node = next_node;
    }
    printf("%c\n", end_node->name);
}

int main() {
    // 初始化任务节点
    Task task_A = {'A', 5, 0, 0, 0, NULL};
    Task task_B = {'B', 3, 0, 0, 0, (TaskPtr[]){&task_A, NULL}};
    Task task_C = {'C', 2, 0, 0, 0, (TaskPtr[]){&task_A, NULL}};
    Task task_D = {'D', 4, 0, 0, 0, (TaskPtr[]){&task_B, NULL}};
    Task task_E = {'E', 3, 0, 0, 0, (TaskPtr[]){&task_C, NULL}};
    Task task_F = {'F', 2, 0, 0, 0, (TaskPtr[]){&task_D, &task_E, NULL}};

    // 计算关键路径
    calc_critical_path(&task_A, &task_F);

    return 0;
}

在此示例代码中，我们使用了一个 `Task` 结构体来表示每个任务节点，其中包含任务名称、任务持续时间、最早开始时间、最晚开始时间、浮动时间以及依赖关系等信息。我们还定义了一个 `TaskPtr` 类型来表示任务节点指针。

在 `calc_critical_path` 函数中，我们首先计算每个任务节点的最早开始时间，然后计算每个任务节点的最晚开始时间和浮动时间，最后根据浮动时间找到关键路径上的任务节点。在主函数中，我们初始化了所有任务节点，并调用 `calc_critical_path` 函数计算关键路径。

运行此示例代码，输出结果为 `A B D F`，表示 AOE 网络的关键路径为 A -> B -> D -> F。