tpl_euclidian_graph_example.cc File Reference

Educational examples for Euclidean graphs with geometric positions. More...

#include <iostream>
#include <cmath>
#include <tpl_euclidian_graph.H>
#include <point.H>

Include dependency graph for tpl_euclidian_graph_example.cc:

Go to the source code of this file.

Functions
int	main ()

Detailed Description

Educational examples for Euclidean graphs with geometric positions.

WHAT IS A EUCLIDEAN GRAPH?

Graph where nodes have 2D/3D positions and arc weights are Euclidean distances Distances are computed AUTOMATICALLY from node positions Ideal for geographic, spatial, and geometric applications

KEY FEATURE:

You just specify node positions - distances are auto-calculated! Perfect for maps, GIS, robotics, network planning

COMPILE & RUN:

g++ -std=c++20 -I.. -o tpl_euclidian_graph_example tpl_euclidian_graph_example.cc -lm ./tpl_euclidian_graph_example

Definition in file tpl_euclidian_graph_example.cc.

Function Documentation

main()

int main

(

)

Definition at line 30 of file tpl_euclidian_graph_example.cc.

References Aleph::DynList< T >::append(), Aleph::maps(), Aleph::Filter_Iterator< Container, It, Show_Item >::next(), nodes, Aleph::HTList::size(), and y.