ELF>,@Xa@8 @@@@HH %%@@@ X\XlXlh\hlhl88800hhhDDStd88800PtdPKPKPK\\QtdRtdX\XlXl/lib64/ld-linux-x86-64.so.2 GNUGNU㍇}CpRF&^LdGNU0@03|emCEqX[sSLTh~lF3D<k d v7 _IN0Ip"pp_ITM_registerTMCloneTable_ITM_deregisterTMCloneTable__gmon_start__GetGDALDriverManagerGDALVersionInfoEarlySetConfigOptionsCPLprintf_ZNK10OGRFeature12DumpReadableEP8_IO_FILEPPc_ZN10GDALDriver6CreateEPKciii12GDALDataTypePPcGDALGeneralCmdLineProcessorCPLQuietErrorHandler_ZN17GDALDriverManager15GetDriverByNameEPKcVSIFree_ZNK19OGRSpatialReference17exportToPrettyWktEPPci_ZN10OGRFeature14DestroyFeatureEPS_GDALAllRegisterCSLFindNameCPLPopErrorHandlerCPLStrdupGDALCloseCPLPushErrorHandlerGDALDestroyDriverManager_ZNK12OGRFieldDefn10GetDefaultEvOGRGeometryTypeToNameCPLSPrintfCSLDestroyCPLDebugCPLErrorResetCSLAddStringCSLFetchNameValueDef_ZN12OGRFieldDefn16GetFieldTypeNameE12OGRFieldTypeCSLAddNameValueGDALOpenExGDALCheckVersion_ZN12OGRFieldDefn19GetFieldSubTypeNameE15OGRFieldSubTypeCPLTestBool__printf_chkexitputs__stack_chk_failputcharstrtol__fprintf_chkstrcasecmpstderrfwrite__cxa_finalize__libc_start_mainlibgdal.so.28libc.so.6_edata__bss_start_endGLIBC_2.2.5GLIBC_2.4GLIBC_2.3.4ui ii ti Xl-`l-ppo oooo1oo+nnnnnnnnn n n n nnnnoooo o(o0o8o@oHoPo Xo!`o"ho#po$xo%o&o'o(o)o*o,o-o.o/HHOHtH5JN%KNhhhhhhhhqhah Qh Ah 1h !h hhhhhhhhhhqhahQhAh1h!hhhh h!h"h#h$h%h&h'qh(a%MD%KD%KD%KD%KD%KD%}KD%uKD%mKD%eKD%]KD%UKD%MKD%EKD%=KD%5KD%-KD%%KD%KD%KD% KD%KD%JD%JD%JD%JD%JD%JD%JD%JD%JD%JD%JD%JD%JD%JD%JD%JD%}JD%uJD%mJD%eJDAWAVAUATUSHhHHt$XHt$X1\Ht$XAŅzH#E1D$HD$(HD$8HD$0HD$PHD$HHD$ D$HD$HD$HD$@fDH5#LH5#LD9%J|% 1 1HHD$HD$XJ| D$HHD$A9Hl$XH5"H}cHcH5#L|L$LHH5"LH5"L AA9|$|$c|$HD$@HE111Ҿ HHHgHLD$(HT$Ht$HH|$ IPLE1AVLL$HLD$@HL$`HT$XHt$0X ZYAH|$0VH|$8LH|$(BH|$X8MtHELHhHKBH5!LumD9QJ|% 1 1HHD$HD$XJ|  1HHD$HD$XJ| D$D$DH5X!L!t5H5N!Lu/D9XJD%HD$ D$H5!LukD97JD%HD$HtH= AH H5CIHD$XH1IH|$XHhD[]A\A]A^A_H5 LNtH5 L;kH5r L$D9jJt%H|$0aHD$0HL$@HEH'AH81H|$0%H|$8H|$(H|$XH|$@4H|$H|$H|$@E111Ҿ HHeHLD$(DHE14H|$@HH|$cH|$WE111Ҿ mHHH|$(H5pt~HELD$(wD9JD%HD$PtH=1uH5LunD9Jt%H|$8HD$8$\$H5H=1H=1H|$(H5H^HD$(9H5^Lu*D9}SJt%H|$(JHD$(11A?-HD$@HLEL|$@~H=LH=HeLH=s1HBH=1멿똉LH=|1oHf1I^HHPTL H H=XBH=BHBH9tHBHt H=BH5BH)HH?HHHtHmBHtfD=Bu+UH=RBHt H=fBd]B]wATIH=,SH8t;H=(Mt HALHH81yH=MufDAWAVAUATUSHHXdH%(HD$HH IHHH5H1'HHHHPPAŃ E1L5@HHDHHPXxHHULDHE1E9uHHE1Lt$ H5H1| L$ D$(L$0D$8fAHLDHuEHHDHHPX\$8T$(H=HpL$0D$ AGD9uHD$E1HD$JDHt$1$LD$IWLH51H|$AFD9AHHDHHPXIHLPHHuH=cHD$IfH11HHHHHuHD$HdH+%(pHX[]A\A]A^A_HHH5H1HHH5H1HHt$ H L$ D$(L$0D$8HHHHHHt$1HHT$H51H|$HHX8t"HHXH5_H1EL=oH@8u Av$L1AV$H51}l$IVH51_D9l$HHuHHPXIAoL1 H51l$AF$ujHHX8IVH5V1E1L5Pf.+}ILLH1HDMDE1HUH5 nM0twHoHtHbH5H1< AnI$LPA9I$LDP x,HŅPxXHcH51q\$8T$(H=L$0D$ KH=HD$eff.@AWAVIAUIATIULSHH4$LL$(LHLHHpIHH5sLP(H H5 HHy-H1LE1UHt$E11IXZMQMH=:ILLH+FHtxILŅE1fDAD9tNIDLH9uIDLt'HQ:/H=H`1IHL$LLL@H|$PtUL1H[]A\A]A^A_IELILHH9H81H$H5J1eE1#H9L$LHH81`HY9H $HH81gL-DAWL=5AVIAUIATAUH-5SL)H/Ht1LLDAHH9uH[]A\A]A^A_ff.HHUsage: gnmanalyse [--help][-q][-quiet][--long-usage] [dijkstra start_gfid end_gfid [[-alo NAME=VALUE] ...]] [kpaths start_gfid end_gfid k [[-alo NAME=VALUE] ...]] [resource [[-alo NAME=VALUE] ...]] [-ds ds_name][-f ds_format][-l layer_name] [[-dsco NAME=VALUE] ...][-lco NAME=VALUE] gnm_name Note: gnmanalyse --long-usage for full help. dijkstra start_gfid end_gfid: calculates the best path between two points using Dijkstra algorithm from start_gfid point to end_gfid point kpaths start_gfid end_gfid k: calculates k (up to 10) best paths between two points using Yen's algorithm (which internally uses Dijkstra algorithm for single path calculating) from start_gfid point to end_gfid point resource: calculates the "resource distribution". The connected components search is performed using breadth-first search and starting from that features which are marked by rules as 'EMITTERS' -ds ds_name: the name&path of the dataset to save the layer with resulting paths. Not need to be existed dataset -f ds_format: define this to set the format of newly created dataset -l layer_name: the name of the resulting layer. If the layer exists already - it will be rewritten. For K shortest paths several layers are created in format layer_nameN, where N - is number of the path (0 - is the most shortest one) -dsco NAME=VALUE: Dataset creation option (format specific) -lco NAME=VALUE: Layer creation option (format specific) -alo NAME=VALUE: Algorithm option (format specific) gnm_name: the network to work with (path and name)Extent (%s): (%f, %f) - (%f, %f) %s driver does not support data source creation. %s driver failed to create %s DeleteLayer() failed when overwrite requested. FAILURE: Can not copy path to %s Path successfully copied and added to the network at %s %s was compiled against GDAL %s and is running against GDAL %s %s option requires %d argument(s)Invalid input from or to identificators Failed to open network at %s Need an operation. See help what you can do with gnmanalyse: FAILURE: %s Layer name: %s Geometry (%s): %s Geometry: %s Feature Count: %lld Extent: (%f, %f) - (%f, %f) (unknown)SRS WKT (%s): %s Layer SRS WKT: %s FID Column = %s NOT NULL %s(%s)%s: %s (%d.%d) NOT NULL DEFAULT %sGeometry Column %d %s driver not available FALSEDCAP_CREATEESRI Shapefile--utility_versionRELEASE_NAME3.2.2--help--long-usage-q-quietdijkstrakpathsresource-ds-f-of-l-dsco-lco-aloUnknown option name '%s'No network dataset providednum_pathsNo K in options, add %d valueGNM%d$Id: gnmanalyse.cpp 2dd182b498f0381aa3bc200928681dfbcf2ecfa6 2020-02-04 10:22:31 +0100 Enrico Weigelt, metux IT consult $;\ pxXPXzRx /D$48FJ w?:*3$"\tjBKF LBBB B(A0C8Gm 8A0A(B BBBA T[BBE E(D0D8DPiXI`SXAP 8A0A(B BBBA \TX~FBB B(A0H8DIH_A 8D0A(B BBBA D8eFIE E(D0H8G@n8A0A(B BBB`-- 7Xl`lo  hnp  oo@ oo ohl0 @ P ` p !! !0!@!P!`!p!!!!!!!!!"" "0"@"P"`"p"""""pe38d87f87d439d70b752804682265ea14ca364.debugO.shstrtab.interp.note.gnu.property.note.gnu.build-id.note.ABI-tag.gnu.hash.dynsym.dynstr.gnu.version.gnu.version_r.rela.dyn.rela.plt.init.plt.got.plt.sec.text.fini.rodata.eh_frame_hdr.eh_frame.init_array.fini_array.dynamic.data.bss.gnu_debuglink 880&hh$9 Go4Q Y ao hno@ @ @} Bpp  """"`%`%77 @@P PKPK\KKXlX\`l`\hlh\hnh^p`p``4D`