40 lines
1.1 KiB
C
40 lines
1.1 KiB
C
#include <stdlib.h>
|
|
#include <stdio.h>
|
|
#include "graph.h"
|
|
|
|
int main(void) {
|
|
Graph *graph = graph_create(GRAPH_UNDIRECTED);
|
|
|
|
graph_add_vertex(graph); // 0
|
|
graph_add_vertex(graph); // 1
|
|
graph_add_vertex(graph); // 2
|
|
graph_add_vertex(graph); // 3
|
|
graph_add_vertex(graph); // 4
|
|
graph_add_vertex(graph); // 5
|
|
graph_add_vertex(graph); // 6
|
|
graph_add_vertex(graph); // 7
|
|
|
|
graph_connect_vertex(graph, 0, 1, 5);
|
|
graph_connect_vertex(graph, 0, 2, 2);
|
|
graph_connect_vertex(graph, 1, 2, 1);
|
|
graph_connect_vertex(graph, 1, 3, 3);
|
|
graph_connect_vertex(graph, 1, 4, 12);
|
|
graph_connect_vertex(graph, 2, 3, 7);
|
|
graph_connect_vertex(graph, 2, 5, 10);
|
|
graph_connect_vertex(graph, 3, 4, 2);
|
|
graph_connect_vertex(graph, 3, 5, 6);
|
|
graph_connect_vertex(graph, 4, 6, 1);
|
|
graph_connect_vertex(graph, 5, 6, 3);
|
|
graph_connect_vertex(graph, 5, 7, 5);
|
|
graph_connect_vertex(graph, 6, 7, 2);
|
|
|
|
DijkstraResult result;
|
|
graph_dijkstra(graph, 0, &result);
|
|
|
|
puts("Algoritmo de dijsktra");
|
|
graph_print(graph);
|
|
dijkstra_print_result(&result);
|
|
|
|
return EXIT_SUCCESS;
|
|
}
|