int main()
{
struct Graph *graph = NULL;
struct Graph *Dijkstra_Graph = NULL;
int V=5;
/// create array
graph = CreateGraph(V);
addEdge(graph, 0, 1,1);
addEdge(graph, 0, 4,2);
addEdge(graph, 1, 2,2);
addEdge(graph, 1, 3,3);
addEdge(graph, 1, 4,5);
addEdge(graph, 2, 3,1);
addEdge(graph, 3, 4,4);
//printf("Enter value");
printGraph(graph);
printf("Dijkstra Algorithm\n");
Dijkstra_Graph = CreateGraph(V);
// print the adjacency list representation of the above graph
dijkstra_algorithm(graph , Dijkstra_Graph);
printGraph(Dijkstra_Graph);
return 0;
}
//run algorithm
void lsRT::run_algorithm(int number_of_nodes){
//create vector to hold each node's map
node_map.resize(number_of_nodes);
for(int i=0; i<number_of_nodes; i++){
node_map[i][] = dijkstra_algorithm(graph.node_pool[i]);
}
}//end of run_algorithm
int main(int argc, char **argv)
{
std::vector<double> points;
std::vector<unsigned> faces;
geodesic::read_mesh_from_file("hedgehog_mesh.txt",points,faces);
geodesic::Mesh mesh;
mesh.initialize_mesh_data(points, faces); //create internal mesh data structure including edges
geodesic::GeodesicAlgorithmExact exact_algorithm(&mesh); //exact algorithm
geodesic::GeodesicAlgorithmDijkstra dijkstra_algorithm(&mesh); //simplest approximate algorithm: path only allowed on the edges of the mesh
unsigned const subdivision_level = 3; //three additional vertices per every edge in subdivision algorithm
geodesic::GeodesicAlgorithmSubdivision subdivision_algorithm(&mesh,2); //with subdivision_level=0 this algorithm becomes Dijkstra, with subdivision_level->infinity it becomes exact
std::vector<geodesic::GeodesicAlgorithmBase* > all_algorithms; //for simplicity, store all possible geodesic algorithms here
all_algorithms.push_back(&dijkstra_algorithm);
all_algorithms.push_back(&subdivision_algorithm);
all_algorithms.push_back(&exact_algorithm);
std::vector<geodesic::SurfacePoint> sources;
sources.push_back(geodesic::SurfacePoint(&mesh.vertices()[0])); //one source is located at vertex zero
sources.push_back(geodesic::SurfacePoint(&mesh.edges()[12])); //second source is located in the middle of edge 12
sources.push_back(geodesic::SurfacePoint(&mesh.faces()[20])); //third source is located in the middle of face 20
std::vector<geodesic::SurfacePoint> targets; //same thing with targets
targets.push_back(geodesic::SurfacePoint(&mesh.vertices().back()));
targets.push_back(geodesic::SurfacePoint(&mesh.edges()[10]));
targets.push_back(geodesic::SurfacePoint(&mesh.faces()[3]));
for(unsigned index=0; index<all_algorithms.size(); ++index)
{
geodesic::GeodesicAlgorithmBase* algorithm = all_algorithms[index]; //all algorithms are derived from GeodesicAlgorithmBase
std::cout << std::endl << "results for algorithm " << algorithm->name() << std::endl;
algorithm->propagate(sources); //cover the whole mesh
algorithm->print_statistics();
//------------------first task: compute the pathes to the targets----
std::vector<geodesic::SurfacePoint> path;
for(int i=0; i<targets.size(); ++i)
{
algorithm->trace_back(targets[i], path);
print_info_about_path(path);
}
//------------------second task: for each source, find the furthest vertex that it covers ----
std::vector<double> max_distance(sources.size(), 0.0); //distance to the furthest vertex that is covered by the given source
for(int i=0; i<mesh.vertices().size(); ++i)
{
geodesic::SurfacePoint p(&mesh.vertices()[i]);
double distance;
unsigned best_source = algorithm->best_source(p,distance);
max_distance[best_source] = std::max(max_distance[best_source], distance);
}
std::cout << std::endl;
for(int i=0; i<max_distance.size(); ++i)
{
std::cout << "distance to the furthest vertex that is covered by source " << i
<< " is " << max_distance[i]
<< std::endl;
}
}
return 0;
}
