int main(){
head = NULL;
node* temp;
int A[7] = {9,4,15,2,6,12,17};
int i;
for(i =0 ; i<7 ; i ++){
temp = insert(head,A[i]);
}
printf("all info\n");
print_preorder_all(head);
printf("\n");
printf("The min of tree is %d \n",min_tree(head));
printf("The max of tree is %d \n",max_tree(head));
return 0;
}
int main()
{
Graph<> graph(GraphTypes::UNDIRECTED, GraphTypes::WEIGHTED, GraphTypes::NOCONTENT);
Graph<> min_tree(GraphTypes::UNDIRECTED, GraphTypes::WEIGHTED, GraphTypes::NOCONTENT);
GraphvizAttributesHolder config("resRoute");
typedef Acm<> Acm;
typedef Exporter<> Export;
//Labels pour les villes
config.attributesOf(1).setLabel("Artigueloutan");
config.attributesOf(2).setLabel("Billère");
config.attributesOf(3).setLabel("Bizanos");
config.attributesOf(4).setLabel("Gan");
config.attributesOf(5).setLabel("Gelos");
config.attributesOf(6).setLabel("Idron");
config.attributesOf(7).setLabel("Jurançon");
config.attributesOf(8).setLabel("Lescar");
config.attributesOf(9).setLabel("Lons");
config.attributesOf(10).setLabel("Mazères-Lezons");
config.attributesOf(11).setLabel("Ousse");
config.attributesOf(12).setLabel("Pau");
config.attributesOf(13).setLabel("Sendets");
//On ajoute maintenant les arcs
//Tous les noeuds sont impliqués
//dans des relations, pas d'ajout séparé
//Liaisons Artigueloutan
graph.add_edge(1,10,12.2);
graph.add_edge(1,11,3.1);
graph.add_edge(1,13,4.3);
//liaisons Billière
graph.add_edge(2,4,11.1);
graph.add_edge(2,7,4.5);
graph.add_edge(2,8,5.2);
graph.add_edge(2,12,2.9);
//liaisons Bizanos
graph.add_edge(3,6,5.7);
graph.add_edge(3,10,2.9);
graph.add_edge(3,12,2.2);
//liaisons Gan
graph.add_edge(4,5,8.4);
graph.add_edge(4,6,13.3);
graph.add_edge(4,7,8.1);
graph.add_edge(4,10,9.1);
graph.add_edge(4,12,10.1);
//liaisons Gelos
graph.add_edge(5,10,2.2);
graph.add_edge(5,12,3.2);
//liaisons Idron
graph.add_edge(6,8,13.3);
graph.add_edge(6,9,10.9);
graph.add_edge(6,10,5.4);
graph.add_edge(6,11,4.2);
graph.add_edge(6,13,5.3);
//Liaisons Jurançon
graph.add_edge(7,12,3.6);
//Liaisons Lescar
graph.add_edge(8,9,4.2);
graph.add_edge(8,12,7.9);
graph.add_edge(8,13,17.4);
//Liaisons Lons
graph.add_edge(9,12,5.1);
graph.add_edge(9,13,14.1);
//Liaisons Mazères
graph.add_edge(10,12,4.4);
//Liaisons Ousse
graph.add_edge(11,12,10);
graph.add_edge(11,13,1.9);
//Liaison Pau
graph.add_edge(12,13,10.3);
try
{
Export::ToGraphviz(graph, config, "bin/reseau_routier.graph");
std::cout << "Le graphe a été exporté dans le fichier reseau_routier.graph" << std::endl << std::endl;
std::cout << "dot -Tpng bin/reseau_routier.graph -o bin/reseau_routier.png" << std::endl << std::endl;
min_tree = Acm::Prim(graph);
std::cout << "Prim, Coût: " << min_tree.cost() << std::endl << std::endl;
Export::ToGraphviz(min_tree, config, "bin/acm_prim.graph");
std::cout << "L'arbre a été exporté dans le fichier acm_prim.graph" << std::endl;
std::cout << "dot -Tpng bin/acm_prim.graph -o bin/acm_prim.png" << std::endl << std::endl;
min_tree = Acm::Kruskal(graph);
std::cout << "Kruskal, Coût: " << min_tree.cost() << std::endl << std::endl;
Export::ToGraphviz(min_tree, config, "bin/acm_kruskal.graph");
std::cout << "L'arbre a été exporté dans le fichier acm_kruskal.graph" << std::endl;
std::cout << "dot -Tpng bin/acm_kruskal.graph -o bin/acm_kruskal.png" << std::endl << std::endl;
#ifdef _SYSTEM
system("dot -Tpng bin/reseau_routier.graph -o bin/reseau_routier.png");
system("dot -Tpng bin/acm_prim.graph -o bin/acm_prim.png");
system("dot -Tpng bin/acm_kruskal.graph -o bin/acm_kruskal.png");
#endif
}
catch(const GraphException::InvalidOperation & io)
{
std::cout << "Caught GraphException::InvalidOperation:" << std::endl << io.what() << std::endl;
}
catch(const GraphException::InvalidNodeID & in)
{
std::cout << "Caught GraphException::InvalidNodeID:" << std::endl << in.what() << std::endl;
}
catch(const GraphException::InvalidEdge & ie)
{
std::cout << "Caught GraphException::InvalidEdge:" << std::endl << ie.what() << std::endl;
}
catch(const GraphException::BasicGraphException & bge)
{
std::cout << "Caught GraphException::BasicGraphException:" << std::endl << bge.what() << std::endl;
}
catch(const std::exception & e)
{
std::cout << "Caught std::exception:" << std::endl << e.what() << std::endl;
}
catch(...)
{
std::cout << "Caught unexpected exception." << std::endl;
}
return 0;
}
