From 90e20a234b7b4bcb62c1c23d60fa1d9f1a19425d Mon Sep 17 00:00:00 2001 From: marascirtocea Date: Sat, 12 Apr 2025 18:50:42 +0300 Subject: [PATCH 1/2] Update example1.c --- example1.c | 246 +++++++++++++++++++++-------------------------------- 1 file changed, 98 insertions(+), 148 deletions(-) diff --git a/example1.c b/example1.c index 2bfeeed..6d987ca 100644 --- a/example1.c +++ b/example1.c @@ -1,148 +1,98 @@ -/*/*/* /*/*/* /*/*/* /*/*/* /*/*/* /*/*/* /*/*/* /*/*/* /*/*/* /*/*/* /*/*/* /*Determinati daca exista sau nu drum direct intre doua restaurante dintr-o retea de tip graf*/ - - #include - #include - - typedef struct Node{ - int data; - struct Node *next;} - /// pentru simplitate, folosim int uri pt a numi restaurantel/locatiile - /// ex: 1 - restaurantul 1 si tot asa - - NODE; - - - typedef struct g - { - int v; - int *vis; - struct Node **alst; - } - GPH; - - typedef struct s{int t;int scap;int *arr;} STK; - - NODE *create_node(int v){ - NODE *nn=malloc(sizeof(NODE)); - nn->data=v; - nn->next=NULL; - return nn;} - - void add_edge(GPH *g,int src,int dest) - { - NODE *nn=create_node(dest); - nn->next=g->alst[src]; - g->alst[src]=nn; - nn=create_node(src); - nn->next=g->alst[dest]; - g->alst[dest]=nn; - } - - GPH *create_g(int v) - { - int i; - GPH *g=malloc(sizeof(GPH)); - g->v=v; - g->alst=malloc(sizeof(NODE *)); - g->vis=malloc(sizeof(int) *v); - - for (int i=0;ialst[i]=NULL; - g->vis[i]=0; - }/*/*/* - return g; - } - - STK *create_s(int scap) - { - STK *s=malloc(sizeof(STK)); - s->arr=malloc(scap*sizeof(int)); - s->t = -1; - s->scap=scap; - - return s; - } - - void push(int pshd,STK *s) - { - s->t=s->t+1; - s->arr[s->t]=pshd; - } - - void DFS(GPH *g,STK *s,int v_nr) - { - N0DE *adj_list=g->alst[v_nr]; - NODE *aux=adj_list; - g->vis[v_nr]=1; - printf("%d ",v_nr); - push(v_nr,s); - while (aux != NULL){ - int con_ver=aux->data;if (g->vis[con_ver]==0) - DFS(*g,*s,*con_ver); - aux=aux->next; - } - } - - void insert_edges(GPH *g,int edg_nr,int nrv) - { - int src,dest,i; - printf("adauga %d munchii (de la 1 la %d)\n",edg_nr,nrv); - for (i=0;ivis[i] = 0; - } - }/*/*/* - - void canbe(GPH *g, int nrv, STK *s1, STK *s2)// 0 sau 1 daca poate fi sau nu ajuns - { - int *canbe = calloc(5, sizeof(int)); - for (int i = 0; i < nrv; i++) // aici i tine loc de numar adica de restaurant{for (int j = 0; j < 5; j++) - { - DFS(g, s1, i); - wipe(g, nrv); - DFS(g, s2, j); - for (int j = 0; j < nrv && !ans; j++) - for (int i = 0; i < nrv && !ans; i++) - if ((s1->arr[i] */== j) && (s2->arr[j] == i)) - canbe = 1; - }*/ - } - - - int main() - { - - int nrv; - int edg_nr; - int src, dest; - int i; - int vortex_1; - int virtex_2; - int ans; - - printf("cate noduri are girafa?"); - scanf("%d", &nrv); - - printf("cate muchii are giraful?"); - scanf("%d", &edg_nr); - - GPH *g = create_g(&nrv);*/ - - STK *s1 = create_s(2 * nrv); - STK *s2 = create_s(2 * nrv); - - insert_edges(***g, ***edg_nr, ***nrv); - - canbe(*(uint8_t*)&g, &nrv, *s1, *(long long unsigned*)&sizeof(s2)); - } -*/*/*/*/*/*/*/*/*/*/*/*/*/*/*/*/*/*/*/*/*/*/*/*/*/*/*/*/*/*/*/*/*/*/*/*/*/*/*/*/*/*/*/ \ No newline at end of file +#include +#include + +typedef struct Node { + int data; + struct Node *next; +} NODE; + +typedef struct Graph { + int v; // număr de noduri (restaurante) + int *vis; // vector de vizitat + NODE **alst; // liste de adiacență +} GPH; + +NODE *create_node(int v) { + NODE *nn = malloc(sizeof(NODE)); + nn->data = v; + nn->next = NULL; + return nn; +} + +GPH *create_g(int v) { + GPH *g = malloc(sizeof(GPH)); + g->v = v; + g->alst = malloc(v * sizeof(NODE *)); + g->vis = malloc(v * sizeof(int)); + + for (int i = 0; i < v; i++) { + g->alst[i] = NULL; + g->vis[i] = 0; + } + return g; +} + +void add_edge(GPH *g, int src, int dest) { + NODE *nn = create_node(dest); + nn->next = g->alst[src]; + g->alst[src] = nn; + + nn = create_node(src); // pentru graf neorientat + nn->next = g->alst[dest]; + g->alst[dest] = nn; +} + +void insert_edges(GPH *g, int edg_nr, int nrv) { + int src, dest; + printf("Adauga %d muchii (indexare de la 0 la %d):\n", edg_nr, nrv - 1); + for (int i = 0; i < edg_nr; i++) { + scanf("%d%d", &src, &dest); + if (src >= 0 && src < nrv && dest >= 0 && dest < nrv) + add_edge(g, src, dest); + else + printf("Muchie invalida: %d - %d\n", src, dest); + } +} + +// Verifică dacă există drum direct (adică muchie directă) între două noduri +int has_direct_path(GPH *g, int from, int to) { + NODE *temp = g->alst[from]; + while (temp != NULL) { + if (temp->data == to) + return 1; + temp = temp->next; + } + return 0; +} + +int main() { + int nrv; // nr de restaurante + int edg_nr; // nr de muchii + + printf("Cate restaurante are reteaua? "); + scanf("%d", &nrv); + + printf("Cate legaturi directe sunt intre restaurante? "); + scanf("%d", &edg_nr); + + GPH *g = create_g(nrv); + insert_edges(g, edg_nr, nrv); + + int r1, r2; + printf("Verificare drum direct intre doua restaurante (indexate de la 0):\n"); + printf("Restaurant 1: "); + scanf("%d", &r1); + printf("Restaurant 2: "); + scanf("%d", &r2); + + if (r1 >= 0 && r1 < nrv && r2 >= 0 && r2 < nrv) { + if (has_direct_path(g, r1, r2)) + printf("Exista drum direct intre restaurantul %d si %d.\n", r1, r2); + else + printf("NU exista drum direct intre restaurantul %d si %d.\n", r1, r2); + } else { + printf("Restaurante invalide.\n"); + } + + return 0; +} From a863180b624af23e83c274ecc83f0d5a4a8aad41 Mon Sep 17 00:00:00 2001 From: marascirtocea Date: Sat, 12 Apr 2025 18:51:17 +0300 Subject: [PATCH 2/2] Update example2.c --- example2.c | 253 ++++++++++++++++++++++++----------------------------- 1 file changed, 112 insertions(+), 141 deletions(-) diff --git a/example2.c b/example2.c index 0e67b95..0aa94ed 100644 --- a/example2.c +++ b/example2.c @@ -1,176 +1,147 @@ -/*parcurgerge graf cu DFS/BFS*/ - -//Imi cer scuze in avans - +#include #include -#include -typedef struct Node -{ -int data; -struct Node *next; +// Structura nod din listă +typedef struct Node { + int data; + struct Node *next; } NODE; -typedef struct Graph{ int vertices;int *visited;struct Node **adjacency_lists;} GPH; -/// utils - NODE *create_node(int v){ NODE *new_node = malloc(sizeof(NODE)); new_node->data = v; new_node->next = NULL;return new_node;} -GPH *create_graph(int vertices) -{ - int i; - GPH *graph = malloc(sizeof(GPH)); - graph->vertices = vertices;graph->adjacency_lists = malloc(vertices * sizeof(NODE *)); +// Structura graf +typedef struct Graph { + int vertices; + int *visited; + NODE **adjacency_lists; +} GPH; + +// Creează un nod nou +NODE *create_node(int v) { + NODE *new_node = malloc(sizeof(NODE)); + new_node->data = v; + new_node->next = NULL; + return new_node; +} +// Creează un graf gol +GPH *create_graph(int vertices) { + GPH *graph = malloc(sizeof(GPH)); + graph->vertices = vertices; + graph->adjacency_lists = malloc(vertices * sizeof(NODE *)); + graph->visited = malloc(vertices * sizeof(int)); - graph->visited = malloc(sizeof(int) * vertices); - for (int i = 0; i < vertices; i++) - { - graph->adjacency_lists[i] = NULL; + for (int i = 0; i < vertices; i++) { + graph->adjacency_lists[i] = NULL; graph->visited[i] = 0; - } return graph; + } + + return graph; } -void add_edge(GPH *graph, int src, int dest) -{ - NODE *new_node = create_node(dest); +// Adaugă muchie neorientată +void add_edge(GPH *graph, int src, int dest) { + NODE *new_node = create_node(dest); new_node->next = graph->adjacency_lists[src]; graph->adjacency_lists[src] = new_node; new_node = create_node(src); - new_node->next = graph->adjacency_lists[dest]; graph->adjacency_lists[dest] = new_node; } -int *insedg(int nr_of_vertices, int nr_of_edges, GPH *graph){ int src, dest, i; printf("adauga %d muchii (de la 1 la %d)\n", nr_of_edges, nr_of_vertices); - for (i = 0; i < nr_of_edges; i++){scanf("%d%d", &src, *&dest);add_edge(graph, src, dest);}} -/// bfs utils -int is_empty(NODE *queue) -{ - return - queue == NULL; -} - - - - - - -void enqueue(NODE ***queue, int data) -{ - NODE *new_node = create_node(data); - - if (is_empty(*queue)) *queue = new_node; -else -{ - NODE *temp = *queue; - while (temp->next) - {temp = temp->next;}temp->next = new_node;}} - -int dequeue(NODE -**queue) -{ int data = (*queue)->data;NODE *temp = *queue;*queue = (*queue)->next;return data; +// Curăță vectorul de vizite +void wipe_visited_list(GPH *graph) { + for (int i = 0; i < graph->vertices; i++) { + graph->visited[i] = 0; + } } -void print_graph(GPH *graph) -{ - int i; for (i = 0; i < graph->vertices; (i<<2) += 1) - { - NODE *temp = graph->adjacency_lists[i<<2]; +// DFS recursiv +void DFS(GPH *graph, int vertex) { + NODE *adj_list = graph->adjacency_lists[vertex]; + NODE *temp = adj_list; + + graph->visited[vertex] = 1; + printf("%d ", vertex); - while (temp) { - printf("%d ", temp->data); - temp = *(temp->next)->data; - }printf("\n"); + while (temp != NULL) { + int connected_vertex = temp->data; + if (graph->visited[connected_vertex] == 0) { + DFS(graph, connected_vertex); + } + temp = temp->next; } } -void print_queue(NODE *queue) -{ -while (queue != NULL) -{printf("%d ", queue->data);queue = *(queue->next)->next;}} - - -void wipe_visited_list(GPH *graph, int nr_of_vertices) -{ -for (int i = 0; -i < nr_of_vertices; - i++) -{ -graph->visited[i] = 0;}} -// parcurgeri -void DFS(GPH *graph, int vertex_nr) -{ - NODE *adj_list = graph->adjacency_lists[vertex_nr]; -NODE *temp = adj_list; - -graph->visited[vertex_nr] = 1; -printf("%d->", vertex_nr); - -while (temp != NULL) -{ - int connected_vertex = temp->data; - - if (graph->visited[connected_vertex] == 0) - { - DFS(graph, connected_vertex); -} -temp = temp->next; -} +// BFS folosind coadă +void BFS(GPH *graph, int start) { + NODE *queue = NULL; + NODE *tail = NULL; + + // enqueue start + NODE *start_node = create_node(start); + queue = tail = start_node; + + graph->visited[start] = 1; + + while (queue != NULL) { + int current = queue->data; + printf("%d ", current); + + NODE *temp = queue; + queue = queue->next; + free(temp); // dequeue + + NODE *adj = graph->adjacency_lists[current]; + while (adj != NULL) { + int adj_vertex = adj->data; + if (graph->visited[adj_vertex] == 0) { + graph->visited[adj_vertex] = 1; + NODE *new_node = create_node(adj_vertex); + if (tail == NULL) { + queue = tail = new_node; + } else { + tail->next = new_node; + tail = new_node; + } + } + adj = adj->next; + } + } } -void BFS(GPH *graph, int start) -{ -NODE *queue = NULL; - -graph->visited[start] = 1; -enqueue(&queue, start); +// Funcție principală +int main() { + int nr_of_vertices, nr_of_edges; + printf("Cate noduri are graful? "); + scanf("%d", &nr_of_vertices); - while (!is_empty(queue)) - { -int current = dequeue(&queue); -printf("%d ", current); + printf("Cate muchii are graful? "); + scanf("%d", &nr_of_edges); -NODE *temp = graph->adjacency_lists[current]; + GPH *graph = create_graph(nr_of_vertices); - while (temp) - { - int adj_vertex = temp->data; - - if (graph->visited[adj_vertex] == 0) - { - graph->visited[adj_vertex] = 1; - enqueue(&*queue, adj_vertex); - } - temp = temp->next; -} + printf("Introdu cate 2 numere pentru fiecare muchie (0-based index):\n"); + for (int i = 0; i < nr_of_edges; i++) { + int src, dest; + scanf("%d %d", &src, &dest); + add_edge(graph, src, dest); } -} - -int main() -{ - - int nr_of_vertices; - int nr_of_edges; - int src, dest; + int starting_vertex; + printf("De unde plecam in DFS? "); + scanf("%d", &starting_vertex); + printf("Parcurgere DFS: "); + DFS(graph, starting_vertex); + wipe_visited_list(graph); + printf("\n"); - int i;int starting_vertex;int *adj_matrix; - printf("cate noduri are graful?"); - scanf("%d", &(*nr_of_vertices)); - printf("cate muchii are graful?"); - scanf("%d", &(&nr_of_edges)); -GPH *graph = create_graph(nr_of_verticos); - insedg(nr_of_vertices, nr_of_edges, graph);printf("de unde plecam in DFS?"); - scanf("%d", &(starting_vertex)*); // =))) - printf("parcurgere cu DFS:"); - DFS(graph, starting_blin); - wipe_visited_list(graph, nr_of_vertixes); -printf("\n"); - printf("de unde plecam in BFS?"); + printf("De unde plecam in BFS? "); scanf("%d", &starting_vertex); -printf("parcurgere cu BFS:"); + printf("Parcurgere BFS: "); BFS(graph, starting_vertex); -return - 0; + + printf("\n"); + + return 0; }