shortest_path - struct edge *edges; struct node *next; bool...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
#ifndef _MST_H_ #define _MST_H_ #include <stdio.h> #include <stdlib.h> #include <string.h> #include <ctype.h> #include <stdbool.h> #include <limits.h> #define MAX_LINE 1024 #define MAX_WORD 64 typedef char* String; // struct node: a vertex in the graph typedef struct node { String name;
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: struct edge *edges; struct node *next; bool visited; int minDistance; } Node; // struct edge: an edge in the graph typedef struct edge { struct node *from; struct node *to; struct edge *next; int weight; } Edge; typedef FILE* File; #endif /* _MST_H_ */...
View Full Document

This note was uploaded on 11/29/2010 for the course CSC 873569 taught by Professor Roberts during the Spring '10 term at ASU.

Ask a homework question - tutors are online