Running script for params:
PE_Price=
Cable_Price=
max_combinate_groups_elements=
logic= .EOF
Running script for params:
PE_Price=
Cable_Price=
max_combinate_groups_elements=
logic= .EOF
Path dla ID_Way=; len=; Count=
Points_cnt=
WARNING path should be analyzed and aviable in: , because logest first than shortest: for :
WARNING path should be analyzed and aviable in: , because logest first than shortest: for :
No connection to other roads found
#296 max_combinate_groups_elements_for_group number($bit_max=) < number(15)
#297 narzucam fixed liczbe 40 z uwagi na $bit_max= < 15 ilosc max = $elements_cnt=;
#302 max_combinate_groups_elements_for_group setting to current count - number($elements_cnt=);
#309 max_combinate_groups_elements_for_group otherwise setting to default $max_combinate_groups_elements=;
#341Calc $cost_dist_Cnt=; $elements_cnt=; $bit_max= ;
Nowa grupa Ways:; distanceGr=;elements_cnt_Pos=; @bit_max_Pos=; @id_path=; countGr=; point_count_Pos=; len_sum= ; distanceBeg/distanceEnd= /
#239: calc @distanceGr=; @point_count_Pos=;@LineStringCount ; @len_sum=; @distanceBeg=; @distanceEnd=;
#534 there are PathsCrossed - allow to decrease -1
#440 niewlasciwe wyzwlowneie - powinno byc domyslnie when
#576 $max_bit >$elements_cnt=; in $variant=;
#80 try to find next $max_bit >$elements_cnt=; in $variant=;
... $variant_found ; $bit=
#688 (C$+P$ =) v:; b:; bestV=; bestC=
#410 OK - cost:; bit= ( nr ;)
#720 dowiazanie Crossed w srodku grupy @NeighJoin_way_up_ID_Join=!
adding distance to local:== ;
reducing distance to local:== ;
calc_cost_way: calc