26 lines
536 B
C
26 lines
536 B
C
// Laboratorio 8 - Esercizio 2 - Graph.h
|
|
// Matteo Schiff - s295565
|
|
|
|
#ifndef GRAPH_DEFINED
|
|
#define GRAPH_DEFINED
|
|
|
|
#include<stdio.h>
|
|
#include"Item.h"
|
|
#define MAXC 100
|
|
|
|
typedef struct edge
|
|
{
|
|
int v;
|
|
int w;
|
|
int wt;
|
|
} Edge;
|
|
typedef struct graph *Graph;
|
|
Graph GRAPHinit(int V);
|
|
void GRAPHfree(Graph G);
|
|
Graph GRAPHload(FILE *fin);
|
|
void GRAPHbuildLadj(Graph G);
|
|
void GRAPHCheckVertexAdiacency(Graph G);
|
|
void GRAPHprintOrdered(Graph G);
|
|
int GRAPHgetIndex(Graph G, Item item);
|
|
void GRAPHinsertE(Graph G, int v, int w, int wt);
|
|
#endif |