【原】图练习

.h

#ifndef _DIJKSTRA_H_
#define _DIJKSTRA_H_

#include<sys/types.h>
#include<stdio.h>
#include<string.h>
#include<ctype.h>

#define bool   unsigned char
#define TRUE   (1)
#define FALSE  (0)

#define VER_NUM  7
#define MAX_QUEUE_SIZE  100

typedef int ELEMENT_TYPE;

typedef struct
{
    int front;
    int rear;
    int size;
    ELEMENT_TYPE array[MAX_QUEUE_SIZE];
}QUEUE;

typedef struct ver_edge
{
    int weight;
    int to;
    struct ver_edge* next;
}VER_EDGE;

typedef struct 
{
    VER_EDGE* ver_edge;
    bool known;
    int dis;
    int pre_verx;
}VERTEX;

#endif

.C

#include "dijkstra.h"

static QUEUE* ver_queue ;

static VERTEX* vertexs;/* garph is vertexs*/

void init_verQueue()
{
    ver_queue = (QUEUE*)malloc(sizeof(QUEUE));
    ver_queue->front = 0;
    ver_queue->rear = 0;
    ver_queue->array = 0;
    ver_queue->size = 0;
}

bool is_queue_empty(QUEUE* queue)
{
    return 0 == queue->size;
}

void en_queue(QUEUE* queue,ELEMENT_TYPE element)
{
    if(queue->size = MAX_QUEUE_SIZE)
    {
        printf("enqueue fail!
");
        return ;
    }
    queue->array[queue->rear++] = element;
    queue->size++;
}

ELEMENT_TYPE* queue_front(QUEUE* queue)
{
    if( queue->size == 0)
    {
        printf("get front fail!
");
        return ;
    }
    return (queue->array + queue->front);
}

void de_queue(QUEUE* queue)
{
    if(is_queue_empty(queue))
    {
        printf("dequeue fail!
");
        return ;
    }
    queue->front++;
}


void init_vertex()
{
    int i = 0;
    vertexs = (VERTEX*)malloc(VER_NUM*sizeof(VERTEX));
    for( i = 0;i< VER_NUM;i++)
    {
        vertexs[i].ver_edge = NULL;
    }
}
void insert_edge(int from,int to,int weight)
{
    int i = from -1;
    VER_EDGE* temp = (VER_EDGE*)malloc(sizeof(VER_EDGE));
    temp->next = NULL;
    temp->weight = weight;
    temp->to = to;

    temp->next = vertexs[i].ver_edge;
    vertexs[i].ver_edge= temp;
}

/*for graph that has a circle:
how to choose the vertex is a problem,can use foreach or priority queue; 
for acyclic graph: 
use the topological order to get the vertex in loop;
*/

/*算法: 选点、设为known、更新边*/
void dijkstra(int init_ver, VERTEX* vertexs)
{
    
}