#ifndef TP1_H_INCLUDED
#define TP1_H_INCLUDED

#include <stdlib.h>
#include <iostream>
#include <fstream>
#include <string>

using namespace std;

typedef struct list_Node
{
    int value;
    list_Node *next;
    list_Node *arc;
}list_Node;


list_Node* new_Node(int i, list_Node* l);
void free_list(list_Node *l);
list_Node* cree_list(int nbS);
list_Node* recherche(list_Node* G, int ext);
bool add_arc(list_Node* l, int ext, int val);
list_Node* lecture_graphe_prev (string nom);
list_Node* lecture_graphe_succ (string nom);
void aff_graphe(list_Node* G);

list_Node* lbell_equal(list_Node* lhead, list_Node* Ghead);
void bellman(list_Node* G, int source, string name);
void aff_bellman(list_Node* G, int step, int somme, string name);

#endif // TP1_H_INCLUDED
