ELF>@@x6@8 @@@@@@88@8@@@ % % --`-``h$ --`-`TT@T@DDPtd @ @QtdRtd--`-`  /lib64/ld-linux-x86-64.so.2GNU GNU!e^eZE$SLhw@g!X "&(BE |qX92`$rzNC J+_h/9@R@1`e@1`91`xHR`l@1`) 8 @G1`21``1`d@libcgraph.so.6__gmon_start__agnxtedge_initagnxtsubgagnxtnodeaginitagcloseagisdirectedagnameofagfstedgeagapplyagfstsubgagfstnodeagnedgesagreadagsetfileagnnodes_finilibcdt.so.5libc.so.6__printf_chkexitfopenoptindputs__stack_chk_failstdingetopt__fprintf_chkstdoutfclosemallocstderroptoptfwriteopterr__libc_start_mainfree_edata__bss_start_endGLIBC_2.3.4GLIBC_2.4GLIBC_2.2.5ti }ii ui /`/` /`%1`%@1``1`&1` 1`$0` 0`(0`00`80`@0`H0`P0` X0` `0` h0` p0` x0`0`0`0`0`0`0`0`0`0`0`0`0`0`0`0`HH# HtH5# %# @%# h%# h%# h%# h%# h%z# h%r# h%j# hp%b# h`%Z# h P%R# h @%J# h 0%B# h %:# h %2# h%*# h%"# h%# h%# h% # h%# h%" h%" h%" hp%" h`%" hP%" h@%" h0ATUHSH0I# dH%(HD$(1f@HQ?7w$Ű@fC @zC @nC @ QC  AC  1C t@C aC QC A B C *f. :" ?H=B" @1@Hc! H5B 9t HtH5zB =B ? zB u lB H! @HH:B FB E11HHpA He HHtUHtHH B HHA tH H=]! HI@1@=A ~"A A A 5A =A tgHL$(dH3 %(DuuH0[]A\H6! 2`H3! R`H! 1`H 1`H 2`3A E1A@뉿@|11I^HHPTI`@H@H0@fDG1`UH-@1`HHw]øHt]@1`@1`UH-@1`HHHH?HHu]úHt]Hƿ@1`= uUH~] @H= tHtU-`H]{s1fSHH$@Hu[@f.ATH UH-w SHH;Et%HSBHHP[]HZ A\HEHtH8 H HIt3HhH@zpHI$tHzID$LeLH  @@f.AWAAVAAUAATE1ULSLH> L$ ~*fH > @AD;%> |؋> uFu`uz@HHHH[]A\A]A^A_@1@1Ic׾@F> t1Ic־@(> t1Icվ@x > pHcT$ 1@THZHH@[]A\A]A^A_1)fAWAVAUAATUHSH(dH%(HD$1HDt$E1HD$D$ f= THDD1EHE;= f D= Et)D$8= B= D$ D=/= -= D5=  = 1u#HL$dH3 %(6H([]A\A]A^A_H< HHt@1HHHHu-< 1҃}< tA@HBS< HL$E1@HHD$t$|$ IIDDHHt DHPHHBjHuHE1HIu!DLH=HIID$xuLAfH1 H2 H;HXHPH HtHCHH@HuHHHbHttzHxxH9t!HWruH$%H$HtHHHy8fDH;y  HBHp H@F: N?Hx8H9uf.UHSHHHG HC HCC$ HCTHHCtkH}H}H}H}HUHHUHPHUHPHUHPHH[]fDC H3mH H=H1{ tHH$H$fD(HT$H4$HHH4$HT$tN@ H{ u*H# H=)H1>HpH H=`H1 [f.H5?d@H16fDHH1#H= tHt1H H fDHI HH DHH= H=H1HDSG HuH?tHHtHCPH{f{ u[fDH[ODf.W Hlu2HHt"HcOt"HTHO:-HEfDH:@f.USHHHHHcWJOH -n - print number of nodes -e - print number of edges -c - print number of connected components -C - print number of clusters -a - print all counts -D - only directed graphs -U - only undirected graphs -r - recursively analyze subgraphs -s - silent -v - verbose -? - print usage By default, gc prints nodes and edges If no files are specified, stdin is usedgc: option -%c unrecognized - ignored @@`@`@`@ @@`@`@`@`@`@`@`@`@`@`@`@`@`@`@`@`@@`@`@`@`@`@`@`@`@`@`@`@@`@@`@@`@`@`@`@`@`@`@`@@`@`@`@@@`@`@@ingraphs: out of memory ingraphs: NULL graph reader <>Can't open %s ingraphs: NULL field in ingdisc argument ;p@@   8PX px@P`p @@XppzRx P*zRx $pFJ w?;*3$"D\"A`,|BHH \ AIH dGBEE E(D0D8GPc 8G0A(B BBBU 8I0A(B BBBLx#BBB E(A0D8D` 8A0A(B BBBA 4dBAD FP]  AABA , ADG0 AAG   x ,pkDfDAAp G DdB4|0AAG  AAC J AAD $Ac D c E oD@eBEE E(H0H8M@l8A0A(B BBB$h@@ 8 @ d@-`-`o@@@  0` @@ o@ooH@-`v @ @ @ @ @ @ @ @ @ @ @& @6 @F @V @f @v @ @ @ @ @ @ @ @ @@@&@@@0@gc.debug[7zXZִF!t/]?Eh=ڊ̓N!$Ȱĺl")-;o DrpHrcչZFwBgHS`rh@)s~y)aGg RrN"LEׂ gn Fn`?y)ǩ*qod2_2OqJ_ns s#JzXIJǟO-~ی9G?%P=|<*cwj#v׺ Ѧ7rJ\c٭^8[OEl. @H5 Ω(,DΘr6qp= |@v*Wp 4ZRAΦW}LWR?#X@RHA"pq޳,2 TE ?ZX#t [:c!, V rP /%银쉆0ql¡xn#{ lǚ 0p a Xh`NNȺns,Fɘw,9KCNj9 OɐߘK'+ UX kC =&fXḱ_:bi;7Gul0MpLJwOX7 ʙFJY)G`u2?Xz"o?);䍒2D̕Ld7.#.hMd&FlZ6p9/Q08P~"kXۡ&5DK*r7Kqp9xj< 춎sK$U7PO5jtոlqM_%:_wf1,1hj=m*gwO7A/h:٦m&EBtDI\AX>1DqEj6TCS1{=\xP 2/[}ckPU azK ˚qN:'֥d3K B%!{gYZ.shstrtab.interp.note.ABI-tag.note.gnu.build-id.gnu.hash.dynsym.dynstr.gnu.version.gnu.version_r.rela.dyn.rela.plt.init.text.fini.rodata.eh_frame_hdr.eh_frame.init_array.fini_array.jcr.dynamic.got.got.plt.data.bss.gnu_debuglink.gnu_debugdata 8@8T@T !t@t$4o@L> @F@NoH@HP[o@@j@tB @ ~8 @8 y` @` 0@02d@d p@p @ !@!l-`--`--`--`-/`/0`01`1@ @1`@1! @1P1h5