用c语言做一个算法管理系统，该系统包含了二叉树的创建，查找，插入，删除以及树的遍历和图的创建，图的深度和广度优先遍历，以及用普利姆算法和库鲁斯卡尔算法实现最小生成树，和最短路劲和关键路径以及拓扑排序的实现的相关算法，这些功能都用菜单函数来实现，菜单函数分为树的子菜单和图的子菜单

这是一个非常复杂的系统，需要涵盖多个数据结构和算法。以下是一个简单的示例代码，用于创建二叉树并实现查找、插入、删除和遍历。你可以根据自己的需求和理解进行修改和完善。

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

typedef struct node
{
    int data;
    struct node *left;
    struct node *right;
} Node;

Node *createNode(int value)
{
    Node *newNode = (Node *)malloc(sizeof(Node));
    newNode->data = value;
    newNode->left = NULL;
    newNode->right = NULL;
    return newNode;
}

Node *insert(Node *root, int value)
{
    if (root == NULL)
    {
        root = createNode(value);
    }
    else if (value < root->data)
    {
        root->left = insert(root->left, value);
    }
    else
    {
        root->right = insert(root->right, value);
    }
    return root;
}

Node *findMin(Node *root)
{
    while (root->left != NULL)
    {
        root = root->left;
    }
    return root;
}

Node *delete(Node *root, int value)
{
    if (root == NULL)
    {
        return NULL;
    }
    else if (value < root->data)
    {
        root->left = delete(root->left, value);
    }
    else if (value > root->data)
    {
        root->right = delete(root->right, value);
    }
    else
    {
        if (root->left == NULL && root->right == NULL)
        {
            free(root);
            root = NULL;
        }
        else if (root->left == NULL)
        {
            Node *temp = root;
            root = root->right;
            free(temp);
        }
        else if (root->right == NULL)
        {
            Node *temp = root;
            root = root->left;
            free(temp);
        }
        else
        {
            Node *temp = findMin(root->right);
            root->data = temp->data;
            root->right = delete(root->right, temp->data);
        }
    }
    return root;
}

void inorder(Node *root)
{
    if (root != NULL)
    {
        inorder(root->left);
        printf("%d ", root->data);
        inorder(root->right);
    }
}

void preorder(Node *root)
{
    if (root != NULL)
    {
        printf("%d ", root->data);
        preorder(root->left);
        preorder(root->right);
    }
}

void postorder(Node *root)
{
    if (root != NULL)
    {
        postorder(root->left);
        postorder(root->right);
        printf("%d ", root->data);
    }
}

int main()
{
    Node *root = NULL;

    root = insert(root, 5);
    root = insert(root, 3);
    root = insert(root, 7);
    root = insert(root, 1);
    root = insert(root, 4);

    printf("Inorder traversal: ");
    inorder(root);
    printf("\n");

    printf("Preorder traversal: ");
    preorder(root);
    printf("\n");

    printf("Postorder traversal: ");
    postorder(root);
    printf("\n");

    root = delete(root, 3);

    printf("Inorder traversal after deletion: ");
    inorder(root);
    printf("\n");

    return 0;
}