|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
#include <fstream>#include <iostream>#include <memory>#include <string>#include <ah-errors.H>#include <tpl_graph.H>#include <graph_to_tree.H>#include <generate_tree.H>Go to the source code of this file.
Classes | |
| struct | Ciudad |
| struct | Via |
| struct | Ciudad_Igual |
| struct | GT_Tree< GT > |
| struct | Write_Ciudad |
Macros | |
| #define | INDENT " " |
Typedefs | |
| typedef Graph_Node< Ciudad > | Nodo_Ciudad |
| typedef Graph_Arc< Via > | Arco_Via |
| typedef List_Graph< Nodo_Ciudad, Arco_Via > | Mapa |
| typedef List_Digraph< Nodo_Ciudad, Arco_Via > | Dimapa |
Functions | |
| Mapa::Node * | buscar_ciudad (Mapa &mapa, const string &nombre) |
| void | insert_via (Mapa &mapa, const string &c1, const string &c2, int distancia) |
| void | imprimir_camino (Path< Mapa > &path) |
| void | imprimir_mapa (Mapa &g) |
| void | construir_mapa (Mapa &g) |
| void | escribir_deway (int deway[], const size_t &n) |
| int | main () |
| #define INDENT " " |
Definition at line 40 of file test_search_deway.C.
Definition at line 95 of file test_search_deway.C.
| typedef List_Digraph<Nodo_Ciudad, Arco_Via> Dimapa |
Definition at line 100 of file test_search_deway.C.
| typedef List_Graph<Nodo_Ciudad, Arco_Via> Mapa |
Definition at line 98 of file test_search_deway.C.
| typedef Graph_Node<Ciudad> Nodo_Ciudad |
Definition at line 93 of file test_search_deway.C.
| Mapa::Node * buscar_ciudad | ( | Mapa & | mapa, |
| const string & | nombre | ||
| ) |
Definition at line 113 of file test_search_deway.C.
References Aleph::divide_and_conquer_partition_dp().
Referenced by insert_via(), and main().
| void construir_mapa | ( | Mapa & | g | ) |
| void escribir_deway | ( | int | deway[], |
| const size_t & | n | ||
| ) |
Definition at line 141 of file test_search_deway.C.
References Aleph::divide_and_conquer_partition_dp(), and Aleph::Dlink::Iterator::has_curr().
| void imprimir_mapa | ( | Mapa & | g | ) |
Definition at line 152 of file test_search_deway.C.
References Aleph::divide_and_conquer_partition_dp(), GraphCommon< GT, Node, Arc >::get_connected_node(), GraphCommon< GT, Node, Arc >::get_num_arcs(), GraphCommon< GT, Node, Arc >::get_num_nodes(), GraphCommon< GT, Node, Arc >::get_src_node(), GraphCommon< GT, Node, Arc >::get_tgt_node(), Aleph::Dlink::Iterator::has_curr(), and INDENT.
Referenced by main().
| void insert_via | ( | Mapa & | mapa, |
| const string & | c1, | ||
| const string & | c2, | ||
| int | distancia | ||
| ) |
Definition at line 121 of file test_search_deway.C.
References buscar_ciudad(), and Aleph::divide_and_conquer_partition_dp().
Referenced by construir_mapa().
| int main | ( | ) |
Definition at line 243 of file test_search_deway.C.
References ah_runtime_error_if, Aleph::and, buscar_ciudad(), construir_mapa(), deway(), Aleph::divide_and_conquer_partition_dp(), escribir_deway(), imprimir_mapa(), and test().