_   @D* @ 8"b@ @0@# @0@0h/(" @K \@K O^a K`dh/H   @4 d  @+/t"@# h /H  @ p#|##b#8a#`d#  |  G        /usr/lib/ld.so/dev/zerocrt0: no /usr/lib/ld.so &crt0: /usr/lib/ld.so mapping failure crt0: no /dev/zero Usage: %s outfile 㿘@" @@/t"@/l @@ `@/f    *8   8H ; * ( (    * ( (  ( (     "88* ( (   ((`?㿘 @/&cPlease enter a seed for the random number generator: %dThe seed is %d 㿐 @/   P@/  @/ X@/㿘@/㿘@/@/㿘  "   &@*  @&$@` *********** %s NOT IMPLEMENTED *********** 㿘 @.!X !h@. @.!c Degree Information: c Min:%d Avg:%f Max:%d Std:%f %s '''.`r ?#`h ?  "@`@&"@ 8 6,>*    %@ $@`& 8Б&  ' ' )?-?B?p@.i?x' pB x' ‰J FFĉF 8Ё  D @3 L?@k?hhL'#\#`L' ?@.6a "@.@.2 Welcome to Culberson's Quasi-Random Graph Generator. This program generates quasi-random k-colorable graphs from various classes and with different controlling parameters. Some settings may make the coloring problem hard, some easy. You will be asked for the class of graphs and for various parameters interactively. ENJOY! 㿘 @- HEnter flatness: %dFlatness: %d 㿘 @-! !@- @-!ЁEnter output format for the graph(0-ASCII, 1-binary): Binary ASCII 㿘# ! @-b!@-   "P "X@-zThe order of a graph is the number of vertices in it. Please input the order of the graph: %ldOrder = %ld 㿘 @-V" #@-X @-N# The size of a graph is the number of edges in it. You may specify a control on the size by 1 A probability of assigning an edge for each allowed vertex pair 2 An upper bound on the number of edges Additional Constraints will further limit the size Please input 1 or 2 to indicate your choice: Illegal size type 㿘 @,#h !@,?  @, @, This graph class uses probability to assign edges Please input a floating point number between 0 and 1: %lfProbability = %.10f Illegal probability 㿘 @,  !`@, !h @, 8!   8! @,!@, This graph class is edge limited. The program will try to assign up to but not exceeding the specified number of edges, subject to other constraints. Please input an integer limiting the number of edges to be assigned: The size limit is %ld 㿘 @,\"  #@,^ @,T#The partition number k guarantees that there will be k-coloring because each partition element will be an independent set. If k is chosen greater than or equal to %ld then no partitioning will take place. Please enter the partition number k: The partition number is %ld Illegal partition number 㿘 #P@, #@, @@+ H@  @+ h@+ Partitional variation: If set to 0, each partition element will be as nearly as possible of equal size. If set larger, then elements will vary in size in a uniform manner from ((order/part)-pv) to ((order/part)+pv). Please input Partitional Variation in the range 0 to %ld: Partitional Variation = %ld Illegal Partitional Variation 㿘! @+ @+ #@+ @+! @+}"@+u Probability variation: If set to 0 then each edge is assigned with equal probability. Otherwise, for each pair of partition elements, a random positive or negative quantity is chosen to perturb the edge probability for all edges between that pair. This quantity is limited by the probability variation Please enter a probability variation in the range 0.0 to %f: Probability Variation = %f Value error on probability variation 㿐8!?Ɓ-? @*" !`@*  ( @* 8!    @* H@*ې The girth limit g will ensure that the graph has no simple cycle of size less than g. The minimum simple cycle is g. Thus, setting g to 3 or less has no effect. Note that large values of g (i.e. g>=5) tend to force the graph to be quite sparse, and to consume a lot of CPU time. Please enter girth limit g: The girth limit is %ld 㿘 @*!  #@* @*~"X *********** " Due to the interactions of the inhibitors and generators for edges, the order in which edges are assigned WILL influence the characteristics of the graph generated. To randomize the result, an attempt will be made to randomize the order in which the edges are assigned. You have two choices: 1 - The n choose 2 possibilities are generated and uniformly shuffled. This requires 2*(n choose 2) words of memory. For n=5000 you had better have a LOT of memory. For n=1000 it requires about 4 megabytes. 2 - Vertices are taken in a random order, and from each all potential neighbors of lower index are generated in random order (different for each v). This is NOT equivalent to (1)!! Please enter your edge generation choice: Edge generation choice is Fully random Semi-Random 㿘 @)" #@)@)! 2!"@) Two vertices are determined to be connected if they are within a certain distance of each other. Enter this distance between 0 and 1.0 (it will be used as an absolute distance. Please enter your distance: The distance is %f 㿘@)I"x !`@)K#P @)?  Insert edges if they are at a distance d where: 0: d > %f or 1: d <= %f Choose (0 - 1): Edge if d <= %f > %f 㿘#@) !@)@)     (@( Enter dimension for embedding (at least 1): Dimension = %d 㿘@(  !@( 4 &@(ڐ ؁ Do you want to have wrapping of edges included in the distance calculation? (0 for no, 1 for yes): Wrapping No wrapping 㿘&@(!8 !@( !!@( Do you wish to generate an output file readable by gnuplot? (gnuplot can only handle 2 and 3 dimensional graphs) 0 for no, 1 for yes : Enter file name: %swGnuplot file: %s c Gnuplot file: No gnuplot c No gnuplot @'@(W" !@(Y "&@@(L""@(M@(db&@"@(>@(Ub@(Rc@(0#c@(FThe edge weight w limits clique size <= w+1. w = 0 will result in no edges. Enter initial edge weight w (0-%ld): Initial weight = %d c Initial weight = %d ------------------------------------- Alpha changes the weight of incident pairs which would form triangles if added. Reducing the weight inhibits clique formation, while increasing it increases clustering. ------------------------------------- Change weights by (0) Multiplying or (1) Adding to old weight? Adding Multiplying Enter Alpha from the range [%d, %ld]: [0.0, %0.1f]: Alpha = %f c Alpha: add %f mult by %f Gamma changes the weight of all incident pairs. Reducing the weight reduces average degree, increasing it increases clustering. Enter Gamma from the range Gamma = %f c Gamma: `\@'`?@'e##@'B*`@'? ( H@';# aȐ@'<@'2 p@'D`@'D@'& @'# @'  @'! @'!H@'!p@'!@'!@' "!"@'@'"  "0 @&&@  ` "@'' ?   @&  !`@&"P @&ؔ @&b` bpbx@&@&ߒ@& @&"@&"@&"@&!@&! !@&@ "!"@&@&#@  "0 @&&@  ` "@'' ?   @&  !`@&#8 @&x @&cH@ bpbx@&@&The generator will do its best to create simple cycles which obey the hidden coloring. However, this is not always possible. Enter the maximum number of attempts to create a cycle before giving up: %d Too small. Changing to 1 try. 㿘@&#@&#H@&#@&#@&# !@&@&# @&# &c DESCRIPTION: Quasi-random coloring problem c CODE SOURCE: Joseph Culberson (joe@cs.ualberta.ca) c Creation Date: %swERROR: Cannot open outfile e %d %d ?΂c؝?ϐ @\@%ے`@%ڒ`А@%ג@%Ԓ@%Вa@%א ?ϒ`D$@ @ ?ϒ`H@ !@%Р! @%@%@%@%@%a(2@%!0@% @% @% 4`?*  " P`@%  `@& @%%d ?΂c؝?ϐ @@%x`@%w`А@%t@%q@%ma@%t ?ϒ`D$@ @ ?ϒ`H@ !@%m! @%Z@%Z@%W@%T@%Va(2@%/!0@%' !@%Z"@%P@%M \ ,  :@%I  bq@%:c Specifications: c Random seed: %d p edge %d %ld c No verification required. Getting degree statistics c no cheat Done. 㿐#:a`p@% :# &I"! & &"#("@$`@$# &$c,! &@$#0% & &#84#0@$Ӓ`! &c, $# &4 &@u '  :4@ $# &#@$`@$ :#% &:4 &# ! &@$Ȑ  : "* *  *  *  *  *  *  *  *  * * *  &" #\ & &4 :b#8  :#\ & &4 :b#8 :@$"@$R!Which k-colorable graph? K-coloring schemes: 1 No hidden coloring 2 Equi-partitioned 3 k-colorable 4 k-colorable(smooth) 5 k-colorable with delta variation Alternate graph: 6 Flatgraph ?%d%d Illegal number of vertices .. must be 2-%d c No hidden coloring c Equipartitioned Coloring, %d partitions Enter variability (0-%d) %lf%f c k-colorable, %d partitions, %d variability Enter variability (0.0-1.0) c k-colorable (smooth), %d partitions, %f variability Enter delta (0-%d) c k-colorable (delta), Flatgraph c Flat graph c Probability: %f c Partitions: %d c Flatness: %d Not implemented Which graph type? %s %s %s %s %s %s ?1 IID (independant random edge assignment)2 Girth and Degree Inhibited3 Geometric4 Weight Biased Graph (encourages or inhibits cliques)5 Clique driven6 Cycle drivenEnter edge probability in percent (0.0-1.0) c Probability: %f c random IID graph Only Girth/Degree-limited graphs implemented Enter delta for degree limiting (0-%d) low delta makes the graph flat and high delta has little effect: Enter max delta (%d-%d): c girth/degree-limited graph, girth %d, delta %d, max %d c Geometric graph c Weighted Graph Do you wish to weight color class selection by color class size? (0-no, 1-yes) c Clique driven graph c Class Selection: weighted by size c Class Selection: equal weight c Cycle driven graph ?a @"Đ#X@"#x ?aܠ@"@" (# &[c4c4#@(  : 0@"c@" }" c4 &c c4?!?`*`"p@VVW<XXY#\ :?@  &c4 &`##  @j":!@"``?#\?@  &c4# &c :  @U"! &"c@"q`x:% & @"Q !&@"R!! В @"F  #\ &?c4  :!@."#:a@"N`!B`! &"'@"@@"#! %&@"$ В @"  #\?@  &c4' & :@"#:a@"a0! &"aP㌖ @" W# &% &c4!@"!p@! !&@!!! В @!  #\?c4  :!@ː"#:a@!a!B`! &"'@!ݐ"@!!#&a%& &#0 &c4#\a! &#:@ 3#a#a! &"@!:!@!?@!"@! !ܠ 0@!""#\"0bP"@!b @!@!z ( ? @!q# #&@!raa В @!f ! &"a@!wc8:!@!v?!ܒ@?`*`#`@[x[\] ]^:# :b& &4 &@ז0:!@!ScP0@!4#h+?aآ@) &#4@!*#! '?@!)@@#4@! %?@!@:# :b@&#\@  #4#`@ &c#d &0@#h! &"@@@@!`(:!@!0!:!@! `h:c : & &4 &#@>c00~!:!@ `+?a#\#?a̔!?!Ƞ)?!- &%?4x:#L  :#\b4;`L&#h#l#p &0@ U#t0I@   !?!@ @@@  (:# & &c4 ' @ &@ 0:!@ `@ @ a0!@ a00:!@ aX!?!Z@:# & &c4 ' @ &@ K00@ h"@ ` 㿐 # @ q'' ’@ f?@ d&''  -ąB'㿘 ӖError - variability greater than number of colors ERROR: Variability out of range Unknown graph type, %d Color count : %2d ?a`?&\%'  9\ 9@ '  `@, $@ & &' 8@֐#@ΐ  ! @ & '  D`?'8ɐ&@?*`"@ t &@q & '  `@*`"@ c &8  8 ?@ @ І8?І ƀ@?ȆC8 '  `?І@'?Ȇ@FDB@ * "' &$ & ' D'@ 6 ,``@@ * "` & "c,#(@a`0@/  &#, G@. H`  ' ?! .`*`@ @  "@  @7?!X@`@ @  ` @& '  4`,` @  $`@& &""㿐''  ??@@, * `8 8  B DB"# DDGenerating a geometric graph on %ld vertices. Distance is %f. Dimension of %d There is a %ld colouring %14.12f 㿀''聠D'\h! @l@ ?@v@.@&`  /`p> @t/  _*  < 6_` `a d!聨 ?*  d2; 聨=6 *  2.  ` #&  H* @7@1bX  H* @&@ b` `@c Dimension = %d ---------- c Edge if dist <= %f > %f c Wrapping Warning: graph will be k-complete because distance > 1.0 and wrapping on. c No wrapping Warning: graph will be k-complete because distance > sqrt(dimension). ''@`@!!@I@BB @??@ ?j@a ?F!(?F!0 @3 @  ?@{@{ @ra88(9#(aH@da9#(a@g!!@9ܒ@4#\#`#d#h#l @K '@( ( WARNING: Coloring better than partition This means that due to the choice of probability and partition there exists better colorings than the one specified Color = %d specified partitions = %d c WARNING: Coloring better than partition c This means that due to the choice of probability c and partition there exists better colorings than c the one specified c Color = %d specified partitions = %d c COLOR VERIFICATION: Using the permuted order c under simple greedy yields the specified c coloring number ERROR: Coloring greater than partition number This indicates a program error and should not occur Color = %d Partition = %d c ERROR: Coloring greater than partition number c This indicates a program error and should not occur c Color = %d Partition = %d '`@u   "  @h(`@a @] '@Y ` '| .`"  $"  -    ` *`컐* :  |`@`24,%  |% &  ٰ '@ې X@ؐ @Ր @Ґ !@͔@a8@ah@ܒa@ؒaؠ;a2#'@%H@!"x@#a@@@@ @"@""@@c@cPc@@@@@|The number of edges set is %ld 㿐? +& @6" *  [    & ۖ`@ &ܺ  6  ʖ &@*"؁Do you want to output the cheat with the graph (0-no)? %dNot enough memory for cheat string c cheat %d %d cx %d 㿀@# 0@䀢 4.`@0  &9#(@`8('``@  6)' @ @ px@@ @`@`#`#d`&'#h*` h%   *' #㿐\ `8 T*  " "  #\#` 㿐\`#\#`` (*  " "  #\#`ܚ 㿘 Y&@*  @&$@`Delta hit max. Problem: no change, increasing delta by 1 Final delta: %d Edges not considered: %d p'''`@/ 2  :  @S  @ 6 `.""   `@ @;    @ "`@ @'  'ܮ ,`- *` ' `'*  2B`܅#? "0 9-`\ #\5#` Fh@@ @'* `$ *` 'ܐ $  $`@;   d@&@# @|#`  "#ؒ@o@@@ERROR: Cannot allocate edges 㿀'`'\@u@f '@a'@]' @@U @Q'@L@@F @B'@@>`@@7 @3'@@.&&@ @'@N @J @F @B @@& d@ @&d䀧  / .`"  &"6 / ."  &"䀧6 &6 ' @ߒ$@* %$ $ & 33,,`*`@* @49  %@  %@  @c@ @,`% @$ @@@@?a`?Є8?!@\郒@~Q@ @v2  : @p@n'?ЄDB' @\@d+6$I#\;`@ ֚  ;`@ɚ%&ڴQ @2@%'@"@  '?ЄDB' @@.?!6$#\;`@   ;`@x%&ڴ V?6T &@ޒ'@В' 2  : @ʒ@Ȓ'?ЄDB'@@?!6$袐#\;`@ /  ;`@"%?&ٴ &  "c,?! ' @ * " `*``"2`@8*  *"`2`"㿐 &@ $@@X*  `Ҕ $$@㿘0  *`& "*` . @*`*`*`  (( "ERROR IN INDEX 㿘@ @  2  : "2!@ @ @ 2  : "㿐'BB @3@?@@'&`@2  : 6"&"&@㿐?#@Ւ.`80. F'"@. ( 80B. ''  'FFB' & &Error: Weight not allocated total weight = %ld expected number of edges = %ld . Number of edges = %ld x`lp't_k@d2  : `@ 2 9#(!@kb@9 !@7"Ѐ`" '@O'?DB'!@%"& $.='ܻ/ ?`䀢6@&#耢 9#(!@6c& 拔 ܀ 88? B ܀]8@? BU 6(  " "抐*  "ɐ="Z ( " "a*  "=Қ"1 88? B# 2M8@? B3E 6   ""i?`" 6  ""H?`z"ٔ 4!@)#㿘/```c ?#``c #  \`` "  ` 9`'@,`  $ ' *`'`, *`@  " @,**  $ $*@  " ߸'` .`*`@  Ӑ"*`   * $@`  @6 , m*   ` >@ %@@  Enter (# size) pair for cliques to generate, terminate with 0,0. %d %d edges:%ld Illegal clique size Assigned %ld edges ?ah4@  4?!ܘ?! # *  *  "  * * * *  "  4  *@ "@` ք#@5"0#"x?!ܸ?!?!@.@$  6?!ܐ#\#` #@"#@" Ӑ 4ϐ#@"@.* *` " " ?ap   ?!"@`@`$?!  *`@?aԚ@?!@#@?aԓ+  @@ˢ @,仐$,-`@  ?B -``@ @,?!?!ܠ=*   `  '@ , ?!?!"*    ?aԚ@@  'Cannot add edges to a graph that is all one color Enter (# size) pair for cycles to generate, terminate with 0 0. %d %d%d %d Unable to create cycle Illegal cycle size 㿐4$$@#P0O@#%$$#В@$@ #`.@-2`@ ?"@ "# @6(   2 `? 4 `@@   $@Ґ# $ $p!8"h?  @  >`'`B?@   .   B?  Bxz u/?*  ''  B6 "@ 82 ` " 'JD (ƉF D?" '葢 F (ȉHč& !'ؗ3 <+    '?" '艡Jā ?" '蒂`B? 0 ?/܉ Dܐ  B @$%? C''聠B؁@? * @  @`'DD'HH' ?'LL'PP / 'V'&` L4,lt\D,t\DD9 ''9`h#`` #`@-`?@>2$9` @  !:#a!9  ''9`h #``#`@`?@!29` @ %: !$PHL'D-9? '''9 h#``#`HD` *  ;HH h F#PPL ?L9`` *  ;HH?ؐ@?29`Д @ ;: !'a9 '`'8@?2 "9 ''#8cc@?2%: "$)9  ''9`h #``#`@`?@2-: "%19  ''9`h #``#`@{`?@2r5: "m&;9` ''9`p #``#`@c`?@t2Z9` @5  !:P"a9  ''9`h #``#`@F`?@W2=9a @  !:3#a!9!  ''9`p #``#`@)`?@:2 9a# @ %: !$)9!3 ''9`h #``#`@ `?@29a6 @ސ -: !%19!H ''9`p #``#`@`?@29aK @ 5: !&;9a[ ''9`h #``#`@`?@29a^ @  !:"a9p ''8cc@?2: "##9av ''9`h #``#`@`?@29a| @u ': !$+9a ''9`p #``#`@`?@2}9a @X /: !s%39a ''9`h #``#`@i`?@z2`9a @; 7: !V&9!' '9`p #``#`@L`?@]2C9a @  !:9"9!Ԗ ''9`h #``#`@/`?@@2&9aڔ @  !:##9a ''%9h?@)29a @ ): !%!DH-9  ''38cc2 #?P@LPL?Ё FLP9 x L#``#`@`?ȝP N?@25: "&;9b ''9 DH2 #?P@LPL?Ё\LP9 xB#``#`@w`?ȉFD?@2: ""DH9" ''#8cc2 &?P@QLPL?ЁPLP9 xV#9%9#``#`@`` @йh @'8?@z2`9b @; +: !V%a/9/ ''9`h #``#`@L`?@]2C9b3 @ 3: !9&aHD79T ''8cc *  ;HH?@=2#: ""!9 'Y'9`h #``#`@`?@%2 9b^ @  !:#!㿐'L'H+DD* @ #H H2  "  * +DD* @#H H&"0+DD* @ #D D2  "  "* 0+DD* @#D D ّ. )c( 8Ā`2$H& #" +DD*#@ #D D2   #" * H +DD*#@#D D8cc*  ;HH?9`0`4 *  ;HH9 ĉ$?`2*H2'H& #" +DD*#@ #D D2   #" * +DD*#@#D D9 #``#`H` *  ;HHq?9 8 < *  ;HH < 8@c?`2'H2$H& #" +DD*#@ #D D2   #" * H +DD*#@#D D8cc*  ;HH;?9 0 4 *  ;HH 4 0@-?`2$8& #" +DD*#@ #D D2   #" * H +DD*#@#D D8cc*  ;HH?####? 㿀!9"# .)& ? B''Bª D 0'-@'㿀!9"# .)& ? B''Bª D  0H- H;D'-@'㿀!9"# .)&? B6  ?Bª D 0D'-@'㿀!9"# .)&? B6  ?Bª D 0'-@'㿀@@'㿀y@'㿀!9"?) .+ B6  B B6  (㿘&""    㿘&""   &"`*` 2`@ &", ?, +!@ ɒ 㿘9b  "blx  pX@,$ !*3 7,889HD:P<\=hh?PtPQ4epf0{DO>1LvK_#eg$ JT.k 2E (K$Q<CL&"@%Ss',+;C,a/3V"e\-:) * +.9058-/3? d!6#%4&A'=(7)R*0Z1H2i4D5F678G9p:S;B<^=I>N?M@YATBPDcEFtGWHjIUJMXNbOP[QRUVWX]YhZm[q\y]o^`_`fanbcudxf~ghirjlkl{m|nowp}qrstuvwxyzz{|}~ `  P%, "2d<;M3E >K/S3.[U)dMove"_#G:#[$hf0a$bp$dpoZ$O%&   xP'3/:;)<[*`Ga.+0Qad,[c-dc/mc|0vRZ28HS4p`6p]::I;d`+<0 f<c=QO?(^CX(lH *wI\& s,3dn<1DDJ\3d2ql ]s1{  00 n0 J0( >0, 00#Up ,04 E08 T0 n0 3I0o ej0 0`t1  M0#``d. 2`6 x`< `B5~Ubr^-xtiM,(^<: U___  1``meWfd[l(0Hu,_u6^v@7wHIcA{ R3Q ZRgapK^DP`C1;6dJ `p tP =` T  T,   &b19 W`HY%kb!~ S`e>_etext_edata_endstartstart_float__exit_main_environ__DYNAMIC_exit___main_printf_welcome_whatgraph_masks_set_edge_get_edge_cleargraph_bzero_initrandom_scanf_srand48_dblrand_drand48_ourrand_lrand48.rem_create_and_shuffle_something_get_degree_info.umul_sqrt_sprintf_strcat_getflatness_getformat_getorder_getwhich_getprob_getsize_getpart_getpartvar.div_getprobvar_getgirth_randchoice_getdistance_getdflag_getdimension_getwrap_getgnufile_fopen_getweightedinputs_getmaxattempt_write_graph_DIMACS_ascii_time_ctime_fprintf_fclose_write_graph_DIMACS_bin_strlen_fwrite_specs_memcpy_graph_binary_temp_seed_partitionflag_size_whatgraph_others_order_parm_cheatflag_numpart_verify_verify_color_partset_cheat_getcheat_malloc_free_block_initblock_variab_prob_flat_create_flat_graph_k_color_degree_control_graph_gen_and_print_geo_weighted_graph_gen_clique_graph_gen_cycle_graph_firstclass_lastclass__iob_partitionnumber_distance_gen_geo_graph_colorcompare_calloc_qsort_degree_check_dfsother_dfsblock_shuffle_assign1_update_initweights_deindex_weightedSelect_actualWeight_index_getdelta_clique_cycle_SVID_libm_err_matherr_fp_direction_errno_floor_rint_write_fp_accrued_exceptions_anint_nint_irint_aint_ceil___do_global_dtors___DTOR_LIST____exit_dummy_ref__exit_dummy_decl___do_global_ctors___CTOR_LIST___on_exit/usr/gnu/lib/gcc-lib/sparc-sun-sunos4.1.3/2.6.3:/usr/gnu/libĀ ƀcdl $d\``"\`㿠㿠㿠㿠㿠㿠㿠㿠㿠㿠 㿠 㿠 㿠 㿠 㿠㿠㿠㿠㿠㿠㿠㿠㿠㿠㿠㿠㿠㿠 @??????@(#)sqrt.S 1.11 89/02/24 SMI<`CP>@????.MgkzfJ 5RI\n4~_E~=fkh>yMEaɉm{T*5,Nn.R3JQQ Y$@(#)SVID_libm_err.c 1.9 89/02/27 SMI?.B9?.B=95yRZ28JS4pV`6p`]:l:I;dy`+<0 f<c=QO?(^CX(lH*wI\DJ ]  00 n0 J0( >0,+ 001#UpC ,04J E08P T0[ n0d 3I0loz ej0 0`t M0``d 2` x` `5~br-xiM,(^!<: 2U_>__I O 1```mejWfdy[l(Hu_u^v7wHcA{ 3Q RaK^DP`C1;6&dJ/ `=DpK tPQ =` hTo T,u|  b1 W`%b! S`__DYNAMICcrt0.omain.ogcc2_compiled.___gnu_compiled_c.textutility.ogcc2_compiled.___gnu_compiled_c.text.datainputs.ogcc2_compiled.___gnu_compiled_c.text.dataprintgraph.ogcc2_compiled.___gnu_compiled_c.textwhatgraph.ogcc2_compiled.___gnu_compiled_c.textrandgraph.ogcc2_compiled.___gnu_compiled_c.text.datageomgraph.ogcc2_compiled.___gnu_compiled_c.text.datageomcntrl.ogcc2_compiled.___gnu_compiled_c.text.dataverify.ogcc2_compiled.___gnu_compiled_c.textgraph.ogcc2_compiled.___gnu_compiled_c.textcheat.ogcc2_compiled.___gnu_compiled_c.textgirth.ogcc2_compiled.___gnu_compiled_c.textflat.ogcc2_compiled.___gnu_compiled_c.textweight.ogcc2_compiled.___gnu_compiled_c.text.dataclique.ogcc2_compiled.___gnu_compiled_c.textcycle.ogcc2_compiled.___gnu_compiled_c_swap.textsqrt.oSVID_libm_err.omatherr.orint.o__main.ogcc2_compiled.___gnu_compiled_c/usr/sawnlk4/tmp/gcc-2.6.3/./libgcc2.cint:t1=r1;-2147483648;2147483647;char:t2=r2;0;127;long int:t3=r1;-2147483648;2147483647;unsigned int:t4=r1;0;-1;long unsigned int:t5=r1;0;-1;long long int:t6=r1;01000000000000000000000;0777777777777777777777;long long unsigned int:t7=r1;0000000000000;01777777777777777777777;short int:t8=r1;-32768;32767;short unsigned int:t9=r1;0;65535;signed char:t10=r1;-128;127;unsigned char:t11=r1;0;255;float:t12=r1;4;0;double:t13=r1;8;0;long double:t14=r1;8;0;complex int:t15=s8real:1,0,32;imag:1,32,32;;complex float:t16=r16;4;0;complex double:t17=r17;8;0;complex long double:t18=r18;8;0;void:t19=19arch_type:T20=eARCH_32BIT:0,ARCH_64BIT:1,;reg_class:T21=eNO_REGS:0,GENERAL_REGS:1,FP_REGS:2,ALL_REGS:3,LIM_REG_CLASSES:4,;machine_mode:T22=eVOIDmode:0,QImode:1,HImode:2,PSImode:3,SImode:4,PDImode:5,DImode:6,TImode:7,OImode:8,QFmode:9,HFmode:10,TQFmode:11,SFmode:12,DFmode:13,XFmode:14,TFmode:15,SCmode:16,DCmode:17,XCmode:18,TCmode:19,CQImode:20,CHImode:21,CSImode:22,CDImode:23,CTImode:24,COImode:25,BLKmode:26,CCmode:27,CCXmode:28,CC_NOOVmode:29,CCX_NOOVmode:30,CCFPmode:31,CCFPEmode:32,MAX_MACHINE_MODE:33,;mode_class:T23=eMODE_RANDOM:0,MODE_INT:1,MODE_FLOAT:2,MODE_PARTIAL_INT:3,MODE_CC:4,MODE_COMPLEX_INT:5,MODE_COMPLEX_FLOAT:6,MAX_MODE_CLASS:7,;ptrdiff_t:t1size_t:t5wchar_t:t9UQItype:t11SItype:t1USItype:t4DItype:t6UDItype:t7SFtype:t12DFtype:t13word_type:t1DIstruct:T24=s8high:1,0,32;low:1,32,32;;DIunion:t25=u8s:24,0,64;ll:6,0,64;;func_ptr:t26=*27=f19__do_global_dtors:F19_exit_dummy_ref:G28=*1__do_global_ctors:F19_initialized.6__main:F19.text.data_exit.ogcc2_compiled.___gnu_compiled_c/usr/sawnlk4/tmp/gcc-2.6.3/./libgcc2.cint:t1=r1;-2147483648;2147483647;char:t2=r2;0;127;long int:t3=r1;-2147483648;2147483647;unsigned int:t4=r1;0;-1;long unsigned int:t5=r1;0;-1;long long int:t6=r1;01000000000000000000000;0777777777777777777777;long long unsigned int:t7=r1;0000000000000;01777777777777777777777;short int:t8=r1;-32768;32767;short unsigned int:t9=r1;0;65535;signed char:t10=r1;-128;127;unsigned char:t11=r1;0;255;float:t12=r1;4;0;double:t13=r1;8;0;long double:t14=r1;8;0;complex int:t15=s8real:1,0,32;imag:1,32,32;;complex float:t16=r16;4;0;complex double:t17=r17;8;0;complex long double:t18=r18;8;0;void:t19=19arch_type:T20=eARCH_32BIT:0,ARCH_64BIT:1,;reg_class:T21=eNO_REGS:0,GENERAL_REGS:1,FP_REGS:2,ALL_REGS:3,LIM_REG_CLASSES:4,;machine_mode:T22=eVOIDmode:0,QImode:1,HImode:2,PSImode:3,SImode:4,PDImode:5,DImode:6,TImode:7,OImode:8,QFmode:9,HFmode:10,TQFmode:11,SFmode:12,DFmode:13,XFmode:14,TFmode:15,SCmode:16,DCmode:17,XCmode:18,TCmode:19,CQImode:20,CHImode:21,CSImode:22,CDImode:23,CTImode:24,COImode:25,BLKmode:26,CCmode:27,CCXmode:28,CC_NOOVmode:29,CCX_NOOVmode:30,CCFPmode:31,CCFPEmode:32,MAX_MACHINE_MODE:33,;mode_class:T23=eMODE_RANDOM:0,MODE_INT:1,MODE_FLOAT:2,MODE_PARTIAL_INT:3,MODE_CC:4,MODE_COMPLEX_INT:5,MODE_COMPLEX_FLOAT:6,MAX_MODE_CLASS:7,;ptrdiff_t:t1size_t:t5wchar_t:t9UQItype:t11SItype:t1USItype:t4DItype:t6UDItype:t7SFtype:t12DFtype:t13word_type:t1DIstruct:T24=s8high:1,0,32;low:1,32,32;;DIunion:t25=u8s:24,0,64;ll:6,0,64;;func_ptr:t26=*27=f19_exit_dummy_decl:G1iob.oerrno.o_etext_edata_endstart_main_environ___main_welcome_whatgraph_masks_set_edge_get_edge_cleargraph_initrandom_dblrand_ourrand_create_and_shuffle_something_get_degree_info_sqrt_getflatness_getformat_getorder_getwhich_getprob_getsize_getpart_getpartvar_getprobvar_getgirth_randchoice_getdistance_getdflag_getdimension_getwrap_getgnufile_getweightedinputs_getmaxattempt_write_graph_DIMACS_ascii_write_graph_DIMACS_bin_specs_graph_binary_temp_seed_partitionflag_size_whatgraph_others_order_parm_cheatflag_numpart_verify_verify_color_partset_cheat_getcheat_block_initblock_variab_prob_flat_create_flat_graph_k_color_degree_control_graph_gen_and_print_geo_weighted_graph_gen_clique_graph_gen_cycle_graph_firstclass_lastclass__iob_partitionnumber_distance_gen_geo_graph_colorcompare_degree_check_dfsother_dfsblock_shuffle_assign1_update_initweights_deindex_weightedSelect_actualWeight_index_getdelta_clique_cycle_SVID_libm_err_matherr_fp_direction_errno_floor_rint_fp_accrued_exceptions_anint_nint_irint_aint_ceil___do_global_dtors___DTOR_LIST____exit_dummy_ref__exit_dummy_decl___do_global_ctors___CTOR_LIST__