26 lines
623 B
C
26 lines
623 B
C
// Laboratorio 9 - Esercizio 1 - Graph.h
|
|
// Matteo Schiff - s295565
|
|
|
|
#ifndef GRAPH_DEFINED
|
|
#define GRAPH_DEFINED
|
|
|
|
#include<stdio.h>
|
|
|
|
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 GRAPHstore(Graph G, FILE *fout);
|
|
int GRAPHgetIndex(Graph G, char * item);
|
|
void GRAPHinsertE(Graph G, int v, int w, int wt);
|
|
int GRAPHEdgeCount(Graph G);
|
|
void GRAPHFindCardMinDAG(Graph G, int *cardinality, Edge *edges);
|
|
void GRAPHRemoveEdges(Graph G, Edge *edges, int N);
|
|
void GRAPHmaxPathFromSource(Graph G);
|
|
#endif |