tvdu29/lem_in
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Massive clean up

Browse Source 
cleaned up unused code
normalised push_ants
libft is no longer a submodule
still need to normalise lem_in
This commit is contained in:
Tanguy MAZE
2019-04-10 14:34:59 +02:00
parent fb66233265
commit 5d094ebcaf
127 changed files with 180 additions and 5112 deletions
Download Patch File Download Diff File Expand all files Collapse all files

104
includes/lem_in.h
View File

@@ -6,7 +6,7 @@
/* By: tmaze <tmaze@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2019/03/23 17:31:19 by tmaze #+# #+# */
/* Updated: 2019/04/09 18:35:50 by tmaze ### ########.fr */
/* Updated: 2019/04/10 14:18:13 by tmaze ### ########.fr */
/* */
/* ************************************************************************** */
@@ -15,7 +15,6 @@
# include "libft.h"
# include "limits.h"
# include <fcntl.h>
typedef struct s_node
{
@@ -58,8 +57,6 @@ typedef struct s_ants
struct s_ants *next;
} t_ants;
//LEM_IN MT STRUCTS
typedef struct s_syntax
{
int nb_state;
@@ -72,80 +69,52 @@ typedef struct s_syntax
int l_error;
int s_vert;
int e_vert;
int gr_status;
int gr_status;
int e_cmd;
int e_pos;
int v_flag;
} t_syntax;
typedef struct s_AdjListNode
typedef struct s_temp
{
int dest;
struct s_AdjListNode *next;
} t_adjlist;
int src_ind;
int dest_ind;
struct s_temp *next;
} t_temp;
typedef struct s_temp
typedef struct s_holder
{
int src_ind;
int dest_ind;
struct s_temp *next;
} t_temp;
int count;
t_temp *data;
} t_holder;
typedef struct s_holder
typedef struct s_rdata
{
int count;
t_temp *data;
} t_holder;
char *line;
struct s_rdata *next;
} t_rdata;
typedef struct s_AdjList
{
t_adjlist *head;
} t_adj;
typedef struct s_lm_adj
{
t_ind *head;
} t_lm_adj;
typedef struct s_graph
{
int v;
t_lm_adj *array;
} t_graph;
typedef struct s_neighbour
{
int vertnum;
struct s_neighbor *next;
} t_neighbor;
typedef struct s_rdata
{
char *line;
struct s_rdata *next;
} t_rdata;
//MT-FUNCTIONS
int lm_error_exit(void);
int lm_error_exit(void);
int lm_validate(t_syntax *synt, t_lmdata *lmdata);
int lm_parser(t_syntax *synt, t_lmdata *ldata
, t_holder *holder);
int lm_check_room_before(char **tab, t_syntax *synt);
int lm_add_vertex(t_lmdata *ldata, char *raw, char flag, t_syntax *synt);
t_adjlist *lm_new_node(int dest);
t_graph *lm_creategraph(int v);
void lm_add_edge(t_graph *graph, int src, int dest);
int lm_ext_conn(t_holder *holder, t_lmdata *data, char *raw);
int lm_find_index(t_lmdata *data, char *str);
int lm_add_vertex(t_lmdata *ldata, char *raw, char flag
, t_syntax *synt);
int lm_ext_conn(t_holder *holder, t_lmdata *data
, char *raw);
int lm_find_index(t_lmdata *data, char *str);
int lm_get_value(char *line);
void lm_get_cmd_vert(int count, t_syntax *synt
, t_lmdata *ldata, char *line);
void lm_get_vert_link(int count, t_syntax *synt, t_lmdata *ldata
, t_holder *holder, char *line);
int lm_get_value(char *line);
void lm_get_cmd_vert(int count, t_syntax *synt
, t_lmdata *ldata, char *line);
void lm_get_vert_link(int count, t_syntax *synt
, t_lmdata *ldata, t_holder *holder
, char *line);
int lm_validate_rooms(char *name, char *x, char *y);
int lm_adj_parser(t_lmdata *lmdata, t_holder *holder);
void lm_init_data(t_syntax *synt, t_holder *holder, t_lmdata *ldata);
void lm_init_data(t_syntax *synt, t_holder *holder
, t_lmdata *ldata);
void lm_initdata(t_lmdata *data);
int lm_getparams(t_lmdata *data);
@@ -156,8 +125,17 @@ t_ind *lst_indadd(t_ind **lst, int ind);
void lst_inddel(t_ind **lst);
void tablst_inddel(t_ind **tab);
void bfs(t_lmdata *data, t_bfs *tab, int start_ind, int end_ind);
t_ind **edmunds_karp(t_lmdata *data, int start_ind, int end_ind);
void push_ants(t_lmdata *data, t_ind **paths, int nb_paths);
t_ants *add_ant(t_ants **ants, int nb_ant, int nb_path
, t_ind **paths);
void del_ants(t_ants **ants);
t_node *get_node(t_lmdata *data, int index);
t_ind *get_node_path(t_ind *lst, int index);
void bfs(t_lmdata *data, t_bfs *tab, int start_ind
, int end_ind);
t_ind **edmunds_karp(t_lmdata *data, int start_ind
, int end_ind);
void push_ants(t_lmdata *data, t_ind **paths
, int nb_paths);
#endif