2026-05-06 09:45:22 -06:00
|
|
|
#include <stdlib.h>
|
2026-05-06 22:29:22 -06:00
|
|
|
#include <stdio.h>
|
|
|
|
|
#include "graph.h"
|
2026-05-06 09:45:22 -06:00
|
|
|
|
|
|
|
|
int main(void) {
|
2026-05-06 22:29:22 -06:00
|
|
|
Graph *graph = graph_create(GRAPH_UNDIRECTED);
|
|
|
|
|
|
|
|
|
|
graph_add_vertex(graph);
|
|
|
|
|
graph_add_vertex(graph);
|
|
|
|
|
graph_add_vertex(graph);
|
|
|
|
|
graph_add_vertex(graph);
|
|
|
|
|
graph_add_vertex(graph);
|
|
|
|
|
graph_add_vertex(graph);
|
|
|
|
|
|
|
|
|
|
graph_connect_vertex(graph, 0, 1, 9);
|
|
|
|
|
graph_connect_vertex(graph, 0, 2, 4);
|
|
|
|
|
graph_connect_vertex(graph, 1, 2, 2);
|
|
|
|
|
graph_connect_vertex(graph, 1, 4, 3);
|
|
|
|
|
graph_connect_vertex(graph, 1, 3, 7);
|
|
|
|
|
graph_connect_vertex(graph, 2, 3, 1);
|
|
|
|
|
graph_connect_vertex(graph, 2, 4, 6);
|
|
|
|
|
graph_connect_vertex(graph, 3, 4, 4);
|
|
|
|
|
graph_connect_vertex(graph, 3, 5, 8);
|
|
|
|
|
graph_connect_vertex(graph, 4, 5, 2);
|
|
|
|
|
|
|
|
|
|
DijkstraResult result;
|
|
|
|
|
graph_dijkstra(graph, 0, &result);
|
|
|
|
|
|
|
|
|
|
puts("Algoritmo de dijsktra");
|
|
|
|
|
graph_print(graph);
|
|
|
|
|
dijkstra_print_result(&result);
|
|
|
|
|
|
2026-05-06 09:45:22 -06:00
|
|
|
return EXIT_SUCCESS;
|
|
|
|
|
}
|