This graph shows which files directly or indirectly include this file:
Go to the source code of this file.
Classes | |
| struct | s_path |
| struct | s_path_mcost |
Typedefs | |
| typedef unsigned int | uint |
Functions | |
| bool | caminho_apartir_vizinhos_unicos (vertex *vertex_web, int dimension, int *caminho_principal, int &elem_max, int &custo_max, int seed) |
| bool | check_visited (vertex *vertex_web, int dimension) |
| void | clear_visited (vertex *vertex_web, uint dimension) |
| bool | computar_caminho_de_ida (vertex *vertex_web, int dimension, int *caminho_de_ida, int &elem_c_ida, int *caminho_principal, int elem_cp, int num_arcos) |
| int | computar_custo_caminho_final (vertex *vertex_web, int *caminho_final, int elem_caminho_final) |
| uint | conscientious_reactive (uint current_vertex, vertex *vertex_web, double *instantaneous_idleness) |
| int | count_intention (uint vertex, int *tab_intention, int nr_robots) |
| int | cyclic (uint dimension, vertex *vertex_web, int *caminho_final) |
| int | devolve_viz_unicos (vertex *vertex_web, int vertice) |
| int | devolve_vizinhos_nao_visitados (vertex *vertex_web, int dimension, int vertice) |
| void | dijkstra (uint source, uint destination, int *shortest_path, uint &elem_s_path, vertex *vertex_web, uint dimension) |
| void | dijkstra_mcost (uint source, uint destination, int *shortest_path, uint &elem_s_path, vertex *vertex_web, double new_costs[][8], uint dimension) |
| uint | get_MSP_dimension (char *msp_file) |
| void | get_MSP_route (uint *route, uint dimension, char *msp_file) |
| uint | greedy_bayesian_strategy (uint current_vertex, vertex *vertex_web, double *instantaneous_idleness, double G1, double G2, double edge_min) |
| uint | heuristic_conscientious_reactive (uint current_vertex, vertex *vertex_web, double *instantaneous_idleness) |
| uint | heuristic_pathfinder_conscientious_cognitive (uint current_vertex, vertex *vertex_web, double *instantaneous_idleness, uint dimension, uint *path) |
| int | is_neigh (uint vertex1, uint vertex2, vertex *vertex_web, uint dimension) |
| int | longest_path (vertex *vertex_web, int origem, int destino, int *lista_v1v, int i_list, int dimension, int seed, int *caminho_parcial, int &elem_cp) |
| bool | pertence (int elemento, int *tab, int tam_tab) |
| int | pertence_idx (int elemento, int *tab, int tam_tab) |
| bool | procurar_ciclo (vertex *vertex_web, uint dimension, int *caminho_principal, int &elem_caminho, int &custo_max, int seed) |
| void | shift_cyclic_path (uint start_vertex, int *caminho_final, int elem_caminho_final) |
| uint | state_exchange_bayesian_strategy (uint current_vertex, vertex *vertex_web, double *instantaneous_idleness, int *tab_intention, int nr_robots, double G1, double G2, double edge_min) |
| bool | UHC (vertex *vertex_web, int v1, int *caminho_principal, uint dimension) |
| bool | verificar_arco_cp (int no_1, int no_2, int *caminho_principal, int elem_cp) |
Typedef Documentation
| typedef unsigned int uint |
Definition at line 38 of file algorithms.h.
Function Documentation
| bool caminho_apartir_vizinhos_unicos | ( | vertex * | vertex_web, |
| int | dimension, | ||
| int * | caminho_principal, | ||
| int & | elem_max, | ||
| int & | custo_max, | ||
| int | seed | ||
| ) |
Definition at line 1608 of file algorithms.h.
| bool check_visited | ( | vertex * | vertex_web, |
| int | dimension | ||
| ) |
Definition at line 1706 of file algorithms.h.
| void clear_visited | ( | vertex * | vertex_web, |
| uint | dimension | ||
| ) |
Definition at line 899 of file algorithms.h.
| bool computar_caminho_de_ida | ( | vertex * | vertex_web, |
| int | dimension, | ||
| int * | caminho_de_ida, | ||
| int & | elem_c_ida, | ||
| int * | caminho_principal, | ||
| int | elem_cp, | ||
| int | num_arcos | ||
| ) |
Definition at line 1748 of file algorithms.h.
| int computar_custo_caminho_final | ( | vertex * | vertex_web, |
| int * | caminho_final, | ||
| int | elem_caminho_final | ||
| ) |
Definition at line 2218 of file algorithms.h.
| uint conscientious_reactive | ( | uint | current_vertex, |
| vertex * | vertex_web, | ||
| double * | instantaneous_idleness | ||
| ) |
Definition at line 54 of file algorithms.h.
| int count_intention | ( | uint | vertex, |
| int * | tab_intention, | ||
| int | nr_robots | ||
| ) |
Definition at line 283 of file algorithms.h.
Definition at line 2244 of file algorithms.h.
| int devolve_viz_unicos | ( | vertex * | vertex_web, |
| int | vertice | ||
| ) |
Definition at line 1280 of file algorithms.h.
| int devolve_vizinhos_nao_visitados | ( | vertex * | vertex_web, |
| int | dimension, | ||
| int | vertice | ||
| ) |
Definition at line 1727 of file algorithms.h.
| void dijkstra | ( | uint | source, |
| uint | destination, | ||
| int * | shortest_path, | ||
| uint & | elem_s_path, | ||
| vertex * | vertex_web, | ||
| uint | dimension | ||
| ) |
Definition at line 385 of file algorithms.h.
| void dijkstra_mcost | ( | uint | source, |
| uint | destination, | ||
| int * | shortest_path, | ||
| uint & | elem_s_path, | ||
| vertex * | vertex_web, | ||
| double | new_costs[][8], | ||
| uint | dimension | ||
| ) |
Definition at line 505 of file algorithms.h.
| uint get_MSP_dimension | ( | char * | msp_file | ) |
Definition at line 2566 of file algorithms.h.
| void get_MSP_route | ( | uint * | route, |
| uint | dimension, | ||
| char * | msp_file | ||
| ) |
Definition at line 2583 of file algorithms.h.
| uint greedy_bayesian_strategy | ( | uint | current_vertex, |
| vertex * | vertex_web, | ||
| double * | instantaneous_idleness, | ||
| double | G1, | ||
| double | G2, | ||
| double | edge_min | ||
| ) |
Definition at line 208 of file algorithms.h.
| uint heuristic_conscientious_reactive | ( | uint | current_vertex, |
| vertex * | vertex_web, | ||
| double * | instantaneous_idleness | ||
| ) |
Definition at line 106 of file algorithms.h.
| uint heuristic_pathfinder_conscientious_cognitive | ( | uint | current_vertex, |
| vertex * | vertex_web, | ||
| double * | instantaneous_idleness, | ||
| uint | dimension, | ||
| uint * | path | ||
| ) |
Definition at line 612 of file algorithms.h.
Definition at line 492 of file algorithms.h.
| int longest_path | ( | vertex * | vertex_web, |
| int | origem, | ||
| int | destino, | ||
| int * | lista_v1v, | ||
| int | i_list, | ||
| int | dimension, | ||
| int | seed, | ||
| int * | caminho_parcial, | ||
| int & | elem_cp | ||
| ) |
Definition at line 1291 of file algorithms.h.
| bool pertence | ( | int | elemento, |
| int * | tab, | ||
| int | tam_tab | ||
| ) |
Definition at line 802 of file algorithms.h.
| int pertence_idx | ( | int | elemento, |
| int * | tab, | ||
| int | tam_tab | ||
| ) |
Definition at line 815 of file algorithms.h.
| bool procurar_ciclo | ( | vertex * | vertex_web, |
| uint | dimension, | ||
| int * | caminho_principal, | ||
| int & | elem_caminho, | ||
| int & | custo_max, | ||
| int | seed | ||
| ) |
Definition at line 912 of file algorithms.h.
| void shift_cyclic_path | ( | uint | start_vertex, |
| int * | caminho_final, | ||
| int | elem_caminho_final | ||
| ) |
Definition at line 2534 of file algorithms.h.
| uint state_exchange_bayesian_strategy | ( | uint | current_vertex, |
| vertex * | vertex_web, | ||
| double * | instantaneous_idleness, | ||
| int * | tab_intention, | ||
| int | nr_robots, | ||
| double | G1, | ||
| double | G2, | ||
| double | edge_min | ||
| ) |
Definition at line 295 of file algorithms.h.
Definition at line 828 of file algorithms.h.
| bool verificar_arco_cp | ( | int | no_1, |
| int | no_2, | ||
| int * | caminho_principal, | ||
| int | elem_cp | ||
| ) |
Definition at line 1680 of file algorithms.h.