-
Notifications
You must be signed in to change notification settings - Fork 0
/
Project.nlogo
1223 lines (1056 loc) · 28.7 KB
/
Project.nlogo
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
globals [
infinity ; used to represent the distance between two turtles with no path between them
average-path-length-of-lattice ; average path length of the initial lattice
average-path-length ; average path length in the current network
clustering-coefficient-of-lattice ; the clustering coefficient of the initial lattice
clustering-coefficient ; the clustering coefficient of the current network (avg. across nodes)
number-rewired ; number of edges that have been rewired
rewire-one? ; these two variables record which button was last pushed
rewire-all?
upper-cycle-length
lower-cycle-length
silence-time
synchronized
]
turtles-own [
clock ;; each firefly's clock
threshold ;; the clock tick at which a firefly stops its flash
reset-level ;; the clock tick a firefly will reset to when it is triggered by other flashing
distance-from-other-turtles ; list of distances of this node from other turtles
my-clustering-coefficient ; the current clustering coefficient of this node
cycle-length
natural-cycle-length
first-cycle-length
first-flash
]
links-own [
rewired? ; keeps track of whether the link has been rewired or not
]
;;;;;;;;;;;;;;;;;;;;;;
;; Setup Procedures ;;
;;;;;;;;;;;;;;;;;;;;;;
to setup
clear-all
reset-ticks
set silence-time 0
set synchronized 0
set upper-cycle-length 115
set lower-cycle-length 85
set infinity 99999 ; this is an arbitrary choice for a large number
set number-rewired 0 ; initial count of rewired edges
; make the nodes and arrange them in a circle in order by who number
set-default-shape turtles "circle"
create-turtles num-nodes [
set first-cycle-length random(300)
set first-flash 0
set natural-cycle-length lower-cycle-length + (random (upper-cycle-length - lower-cycle-length))
set cycle-length natural-cycle-length
set clock random (round cycle-length)
set threshold flash-length
set reset-level threshold
ifelse num-nodes < 100 [ set size 2 ] [ set size 1 ]
set color gray - 2
]
layout-circle (sort turtles) max-pxcor - 1
; Fix the color scheme
ask links [ set color gray + 2 ]
wire-lattice
; Calculate the initial average path length and clustering coefficient
set average-path-length find-average-path-length
set clustering-coefficient find-clustering-coefficient
set average-path-length-of-lattice average-path-length
set clustering-coefficient-of-lattice clustering-coefficient
; Create the initial lattice
if network-type != "Lattice" [ rewire ]
end
to go
check-sync
if synchronized = 1 and continue-after-sync? = false [
reset-ticks
stop
]
ask turtles [
increment-clock
look
recolor
]
tick
end
;;;;;;;;;;;;;;;;;;;;;
;; Main Procedures ;;
;;;;;;;;;;;;;;;;;;;;;
to rewire-me ; turtle procedure
; node-A remains the same
let node-A end1
; as long as A is not connected to everybody
if [ count link-neighbors ] of end1 < (count turtles - 1) [
; find a node distinct from A and not already a neighbor of "A"
let node-B one-of turtles with [ (self != node-A) and (not link-neighbor? node-A) ]
; wire the new edge
ask node-A [ create-link-with node-B [ set color cyan set rewired? true ] ]
set number-rewired number-rewired + 1
die ; remove the old edge
]
end
to rewire
; confirm we have the right amount of turtles, otherwise reinitialize
if count turtles != num-nodes [ setup ]
let rewiring-probability 1
if network-type = "Small World" [ set rewiring-probability 0.1 ]
; record which button was pushed
set rewire-one? false
set rewire-all? true
; we keep generating networks until we get a connected one since apl doesn't mean anything
; in a non-connected network
let connected? false
while [ not connected? ] [
; kill the old lattice and create new one
ask links [ die ]
wire-lattice
set number-rewired 0
; ask each link to maybe rewire, according to the rewiring-probability slider
ask links [
if (random-float 1) < rewiring-probability [ rewire-me ]
]
; if the apl is infinity, it means our new network is not connected. Reset the lattice.
ifelse find-average-path-length = infinity [ set connected? false ] [ set connected? true ]
if network-type = "Random" [ ifelse find-clustering-coefficient < (clustering-coefficient-of-lattice * 0.1) [set connected? true] [set connected? false] ]
if network-type = "Small World" [ ifelse (find-clustering-coefficient > 0.2 and find-clustering-coefficient < 0.3) [set connected? true] [set connected? false] ]
]
; calculate the statistics and visualize the data
set clustering-coefficient find-clustering-coefficient
set average-path-length find-average-path-length
update-plots
end
;;;;;;;;;;;;;;;;
;; Clustering computations ;;
;;;;;;;;;;;;;;;;
to-report in-neighborhood? [ hood ]
report ( member? end1 hood and member? end2 hood )
end
to-report find-clustering-coefficient
let cc infinity
ifelse all? turtles [ count link-neighbors <= 1 ] [
; it is undefined
; what should this be?
set cc 0
][
let total 0
ask turtles with [ count link-neighbors <= 1 ] [ set my-clustering-coefficient "undefined" ]
ask turtles with [ count link-neighbors > 1 ] [
let hood link-neighbors
set my-clustering-coefficient (2 * count links with [ in-neighborhood? hood ] /
((count hood) * (count hood - 1)) )
; find the sum for the value at turtles
set total total + my-clustering-coefficient
]
; take the average
set cc total / count turtles with [count link-neighbors > 1]
]
report cc
end
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;; Path length computations ;;
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; Procedure to calculate the average-path-length (apl) in the network. If the network is not
; connected, we return `infinity` since apl doesn't really mean anything in a non-connected network.
to-report find-average-path-length
let apl 0
; calculate all the path-lengths for each node
find-path-lengths
let num-connected-pairs sum [length remove infinity (remove 0 distance-from-other-turtles)] of turtles
; In a connected network on N nodes, we should have N(N-1) measurements of distances between pairs.
; If there were any "infinity" length paths between nodes, then the network is disconnected.
ifelse num-connected-pairs != (count turtles * (count turtles - 1)) [
; This means the network is not connected, so we report infinity
set apl infinity
][
set apl (sum [sum distance-from-other-turtles] of turtles) / (num-connected-pairs)
]
report apl
end
; Implements the Floyd Warshall algorithm for All Pairs Shortest Paths
; It is a dynamic programming algorithm which builds bigger solutions
; from the solutions of smaller subproblems using memoization that
; is storing the results. It keeps finding incrementally if there is shorter
; path through the kth node. Since it iterates over all turtles through k,
; so at the end we get the shortest possible path for each i and j.
to find-path-lengths
; reset the distance list
ask turtles [
set distance-from-other-turtles []
]
let i 0
let j 0
let k 0
let node1 one-of turtles
let node2 one-of turtles
let node-count count turtles
; initialize the distance lists
while [i < node-count] [
set j 0
while [ j < node-count ] [
set node1 turtle i
set node2 turtle j
; zero from a node to itself
ifelse i = j [
ask node1 [
set distance-from-other-turtles lput 0 distance-from-other-turtles
]
][
; 1 from a node to it's neighbor
ifelse [ link-neighbor? node1 ] of node2 [
ask node1 [
set distance-from-other-turtles lput 1 distance-from-other-turtles
]
][ ; infinite to everyone else
ask node1 [
set distance-from-other-turtles lput infinity distance-from-other-turtles
]
]
]
set j j + 1
]
set i i + 1
]
set i 0
set j 0
let dummy 0
while [k < node-count] [
set i 0
while [i < node-count] [
set j 0
while [j < node-count] [
; alternate path length through kth node
set dummy ( (item k [distance-from-other-turtles] of turtle i) +
(item j [distance-from-other-turtles] of turtle k))
; is the alternate path shorter?
if dummy < (item j [distance-from-other-turtles] of turtle i) [
ask turtle i [
set distance-from-other-turtles replace-item j distance-from-other-turtles dummy
]
]
set j j + 1
]
set i i + 1
]
set k k + 1
]
end
;;;;;;;;;;;;;;;;;;;;;
;; Edge Operations ;;
;;;;;;;;;;;;;;;;;;;;;
; creates a new lattice
to wire-lattice
; iterate over the turtles
let n 0
while [ n < count turtles ] [
; make edges with the next two neighbors
; this makes a lattice with average degree of 4
make-edge turtle n
turtle ((n + 1) mod count turtles)
"default"
; Make the neighbor's neighbor links curved
make-edge turtle n
turtle ((n + 2) mod count turtles)
"curve"
set n n + 1
]
; Because of the way NetLogo draws curved links between turtles of ascending
; `who` number, two of the links near the top of the network will appear
; flipped by default. To avoid this, we used an inverse curved link shape
; ("curve-a") which makes all of the curves face the same direction.
ask link 0 (count turtles - 2) [ set shape "curve-a" ]
ask link 1 (count turtles - 1) [ set shape "curve-a" ]
end
; Connects two nodes
to make-edge [ node-A node-B the-shape ]
ask node-A [
create-link-with node-B [
set shape the-shape
set rewired? false
]
]
end
;;;;;;;;;;;;;;;;;;;
;; Sync part ;;
;;;;;;;;;;;;;;;;;;;
to check-sync
if ticks > 300 [
ifelse count turtles with [color = yellow] = 0 [
set silence-time silence-time + 1
]
[
ifelse silence-time > silence-time-baseline [
set synchronized 1
]
[
set silence-time 0
]
]
]
end
to increment-clock ; turtle procedure
set clock (clock + 1)
if clock = first-cycle-length and first-flash = 0 [
set first-flash 1
set clock 0
]
if clock = cycle-length and first-flash = 1 [
set clock 0
]
end
to look ; turtle procedure
if count link-neighbors with [color = yellow] >= flashes-to-reset [
let _sin (sin ( 360 * ( clock / cycle-length ) ) ) / (2 * pi)
let _max 0
if _sin > 0 [ set _max _sin ]
let _min 0
if _sin < 0 [ set _min _sin ]
let omega_l ( 1 / upper-cycle-length )
let omega_u ( 1 / lower-cycle-length )
let omega ( 1 / natural-cycle-length )
let omega_i ( 1 / cycle-length )
set omega_i ( omega_i + 0.01 * ( omega - omega_i) + _max * ( omega_l - omega_i ) - _min * ( omega_u - omega_i ) )
set cycle-length round ( 1 / omega_i )
if cycle-length < lower-cycle-length [ set cycle-length lower-cycle-length ]
if cycle-length > upper-cycle-length [ set cycle-length upper-cycle-length ]
]
end
to recolor ; turtle procedure
ifelse (clock < threshold)
[ show-turtle
set color yellow ]
[ set color gray - 2]
;ifelse show-dark-fireflies?
;[ show-turtle ]
;[ hide-turtle ] ]
end
; Copyright 2015 Uri Wilensky.
; See Info tab for full copyright and license.
@#$#@#$#@
GRAPHICS-WINDOW
0
10
613
624
-1
-1
5.0
1
10
1
1
1
0
0
0
1
-60
60
-60
60
1
1
1
ticks
30.0
SLIDER
620
10
1090
43
num-nodes
num-nodes
10
100
30.0
1
1
NIL
HORIZONTAL
MONITOR
790
110
962
155
clustering-coefficient (cc)
clustering-coefficient
3
1
11
MONITOR
620
110
792
155
average-path-length (apl)
average-path-length
3
1
11
BUTTON
750
170
870
215
setup
setup
NIL
1
T
OBSERVER
NIL
NIL
NIL
NIL
1
BUTTON
875
170
980
215
go-once
go
NIL
1
T
OBSERVER
NIL
NIL
NIL
NIL
1
BUTTON
985
170
1100
215
go-forever
go
T
1
T
OBSERVER
NIL
NIL
NIL
NIL
1
SLIDER
1125
10
1297
43
flash-length
flash-length
0
10
2.0
1
1
NIL
HORIZONTAL
SLIDER
1125
45
1297
78
flashes-to-reset
flashes-to-reset
0
10
1.0
1
1
NIL
HORIZONTAL
PLOT
620
225
1330
421
Number of simoultaneously flashing nodes
time
number
300.0
1000.0
0.0
10.0
true
false
"" ""
PENS
"flashing" 1.0 0 -2674135 true "" "plot count turtles with [color = yellow]\n\nif ticks < 300\n[\n set-plot-x-range 300 1000\n]"
"sync" 1.0 0 -16777216 true "" "plot synchronized * 10\nif ticks < 300\n[\n set-plot-x-range 300 1000\n]"
MONITOR
1340
10
1487
55
NIL
[cycle-length] of turtle 0
17
1
11
MONITOR
1340
55
1487
100
NIL
[cycle-length] of turtle 1
17
1
11
MONITOR
1340
100
1487
145
NIL
[cycle-length] of turtle 2
17
1
11
MONITOR
1340
145
1487
190
NIL
[cycle-length] of turtle 3
17
1
11
MONITOR
1340
190
1487
235
NIL
[cycle-length] of turtle 4
17
1
11
MONITOR
1340
235
1487
280
NIL
[cycle-length] of turtle 5
17
1
11
MONITOR
1340
280
1487
325
NIL
[cycle-length] of turtle 6
17
1
11
MONITOR
1340
325
1487
370
NIL
[cycle-length] of turtle 7
17
1
11
MONITOR
1340
370
1487
415
NIL
[cycle-length] of turtle 8
17
1
11
MONITOR
1340
415
1487
460
NIL
[cycle-length] of turtle 9
17
1
11
PLOT
620
420
1330
626
Cycle-length of the first 10 nodes
NIL
NIL
0.0
10.0
0.0
10.0
true
false
"" ""
PENS
"default" 1.0 0 -16777216 true "" "if ticks > 0 [ plot [cycle-length] of turtle 0 ]"
"pen-1" 1.0 0 -7500403 true "" "if ticks > 0 [ plot [cycle-length] of turtle 1 ]"
"pen-2" 1.0 0 -2674135 true "" "if ticks > 0 [ plot [cycle-length] of turtle 2 ]"
"pen-3" 1.0 0 -955883 true "" "if ticks > 0 [ plot [cycle-length] of turtle 3 ]"
"pen-4" 1.0 0 -6459832 true "" "if ticks > 0 [ plot [cycle-length] of turtle 4 ]"
"pen-5" 1.0 0 -1184463 true "" "if ticks > 0 [ plot [cycle-length] of turtle 5 ]"
"pen-6" 1.0 0 -10899396 true "" "if ticks > 0 [ plot [cycle-length] of turtle 6 ]"
"pen-7" 1.0 0 -13840069 true "" "if ticks > 0 [ plot [cycle-length] of turtle 7 ]"
"pen-8" 1.0 0 -14835848 true "" "if ticks > 0 [ plot [cycle-length] of turtle 8 ]"
"pen-9" 1.0 0 -11221820 true "" "if ticks > 0 [ plot [cycle-length] of turtle 9 ]"
CHOOSER
950
55
1089
100
network-type
network-type
"Lattice" "Small World" "Random"
2
MONITOR
1220
170
1302
215
NIL
synchronized
17
1
11
SLIDER
620
60
895
93
silence-time-baseline
silence-time-baseline
20
100
80.0
10
1
NIL
HORIZONTAL
MONITOR
1137
170
1204
215
time (s)
(ticks - 300) / 100
17
1
11
SWITCH
1125
85
1292
118
continue-after-sync?
continue-after-sync?
0
1
-1000
CHOOSER
1310
10
1449
55
network-type
network-type
"Lattice" "Small World" "Random"
0
@#$#@#$#@
## WHAT IS IT?
This model is an application of the Firefiles Synchronization model (http://ccl.northwestern.edu/netlogo/models/Fireflies) for the synchronization of Overlay Networks (https://en.wikipedia.org/wiki/Overlay_network). This model takes inspiration from "Firefly-inspired Heartbeat Synchronization in Overlay Networks" (https://doi.org/10.1109/SASO.2007.25).
## HOW IT WORKS
This model wants to evaluate the application of the Ermentrout Synchronization model to different types of networks (lattice, small world and random) and different number of nodes (from 10 to 100).
## HOW TO USE IT
The NUM-NODES slider controls the size of the network.
The FLASH-LENGTH slider controls the length of the flash in terms of ticks.
The SILENCE-TIME-BASELINE slider controls the length of ticks between one emission and the next one. It is a relative measure of synchronization, through this you che change che meaning of synchronization.
The NETWORK-TYPE chooser let you choose between 3 kind of network (Lattice, Small World and Random).
The FLASHES-TO-RESET slider controls how many flashes a node mush see to recompute its own cycle-length.
The CONTINUE-AFTER-SYNC? toggle sets if you want to continue the simulation after the sync happened.
Choose one or more of these parameters and press SETUP.
### Statistics
### Plots
1. The "Number of simoultaneously flashing nodes" visualizes the number of flashing nodes that simoultaneously are flashing. You will see something only after 3 secs, that is the warm up period that you must wait to let the nework to setup. After about 10 secs you will see consecutive peaks. The bigger they are the more the nodes are flashing together.
2. The "Cycle-length of the first 10 nodes" visualizes the value of the first 10 nodes of the network. This is to show the trend of the cycle lengh of the nodes and shows how they change to be synchronized.
## THINGS TO NOTICE
## THINGS TO TRY
## EXTENDING THE MODEL
## NETLOGO FEATURES
## RELATED MODELS
## CREDITS AND REFERENCES
This model is adapted from:
Wilensky, U. (1997). NetLogo Fireflies model. http://ccl.northwestern.edu/netlogo/models/Fireflies. Center for Connected Learning and Computer-Based Modeling, Northwestern University, Evanston, IL.
and
Wilensky, U. (2015). NetLogo Small Worlds model. http://ccl.northwestern.edu/netlogo/models/SmallWorlds. Center for Connected Learning and Computer-Based Modeling, Northwestern University, Evanston, IL.
and it is a Netlogo implementation of:
O. Babaoglu, T. Binci, M. Jelasity and A. Montresor, "Firefly-inspired Heartbeat Synchronization in Overlay Networks*," First International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2007), Cambridge, MA, USA, 2007, pp. 77-86, doi: https://doi.org/10.1109/SASO.2007.25
## HOW TO CITE
If you mention the model or the NetLogo software in a publication, you are asked to include the citations below.
For the model itself:
* Crescenzi, A. (2023). Fireflies synchronization applied to Overlay Networks
https://github.com/alessandro-crescenzi/Fireflies-synchronization-applied-to-Overlay-Networks
Please cite the NetLogo software as:
* Wilensky, U. (1999). NetLogo. http://ccl.northwestern.edu/netlogo/. Center for Connected Learning and Computer-Based Modeling, Northwestern University, Evanston, IL.
## COPYRIGHT AND LICENSE
Copyright (c) 2023 Alessandro Crescenzi - [email protected]
Permission is hereby granted, free of charge, to any person
obtaining a copy of this software and associated documentation
files (the "Software"), to deal in the Software without
restriction, including without limitation the rights to use,
copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the
Software is furnished to do so, subject to the following
conditions:
The above copyright notice and this permission notice shall be
included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
OTHER DEALINGS IN THE SOFTWARE.
<!-- 2023 -->
@#$#@#$#@
default
true
0
Polygon -7500403 true true 150 5 40 250 150 205 260 250
airplane
true
0
Polygon -7500403 true true 150 0 135 15 120 60 120 105 15 165 15 195 120 180 135 240 105 270 120 285 150 270 180 285 210 270 165 240 180 180 285 195 285 165 180 105 180 60 165 15
arrow
true
0
Polygon -7500403 true true 150 0 0 150 105 150 105 293 195 293 195 150 300 150
box
false
0
Polygon -7500403 true true 150 285 285 225 285 75 150 135
Polygon -7500403 true true 150 135 15 75 150 15 285 75
Polygon -7500403 true true 15 75 15 225 150 285 150 135
Line -16777216 false 150 285 150 135
Line -16777216 false 150 135 15 75
Line -16777216 false 150 135 285 75
bug
true
0
Circle -7500403 true true 96 182 108
Circle -7500403 true true 110 127 80
Circle -7500403 true true 110 75 80
Line -7500403 true 150 100 80 30
Line -7500403 true 150 100 220 30
butterfly
true
0
Polygon -7500403 true true 150 165 209 199 225 225 225 255 195 270 165 255 150 240
Polygon -7500403 true true 150 165 89 198 75 225 75 255 105 270 135 255 150 240
Polygon -7500403 true true 139 148 100 105 55 90 25 90 10 105 10 135 25 180 40 195 85 194 139 163
Polygon -7500403 true true 162 150 200 105 245 90 275 90 290 105 290 135 275 180 260 195 215 195 162 165
Polygon -16777216 true false 150 255 135 225 120 150 135 120 150 105 165 120 180 150 165 225
Circle -16777216 true false 135 90 30
Line -16777216 false 150 105 195 60
Line -16777216 false 150 105 105 60
car
false
0
Polygon -7500403 true true 300 180 279 164 261 144 240 135 226 132 213 106 203 84 185 63 159 50 135 50 75 60 0 150 0 165 0 225 300 225 300 180
Circle -16777216 true false 180 180 90
Circle -16777216 true false 30 180 90
Polygon -16777216 true false 162 80 132 78 134 135 209 135 194 105 189 96 180 89
Circle -7500403 true true 47 195 58
Circle -7500403 true true 195 195 58
circle
false
0
Circle -7500403 true true 0 0 300
circle 2
false
0
Circle -7500403 true true 0 0 300
Circle -16777216 true false 30 30 240
cow
false
0
Polygon -7500403 true true 200 193 197 249 179 249 177 196 166 187 140 189 93 191 78 179 72 211 49 209 48 181 37 149 25 120 25 89 45 72 103 84 179 75 198 76 252 64 272 81 293 103 285 121 255 121 242 118 224 167
Polygon -7500403 true true 73 210 86 251 62 249 48 208
Polygon -7500403 true true 25 114 16 195 9 204 23 213 25 200 39 123
cylinder
false
0
Circle -7500403 true true 0 0 300
dot
false
0
Circle -7500403 true true 90 90 120
face happy
false
0
Circle -7500403 true true 8 8 285
Circle -16777216 true false 60 75 60
Circle -16777216 true false 180 75 60
Polygon -16777216 true false 150 255 90 239 62 213 47 191 67 179 90 203 109 218 150 225 192 218 210 203 227 181 251 194 236 217 212 240
face neutral
false
0
Circle -7500403 true true 8 7 285
Circle -16777216 true false 60 75 60
Circle -16777216 true false 180 75 60
Rectangle -16777216 true false 60 195 240 225
face sad
false
0
Circle -7500403 true true 8 8 285
Circle -16777216 true false 60 75 60
Circle -16777216 true false 180 75 60
Polygon -16777216 true false 150 168 90 184 62 210 47 232 67 244 90 220 109 205 150 198 192 205 210 220 227 242 251 229 236 206 212 183
fish
false
0
Polygon -1 true false 44 131 21 87 15 86 0 120 15 150 0 180 13 214 20 212 45 166
Polygon -1 true false 135 195 119 235 95 218 76 210 46 204 60 165
Polygon -1 true false 75 45 83 77 71 103 86 114 166 78 135 60
Polygon -7500403 true true 30 136 151 77 226 81 280 119 292 146 292 160 287 170 270 195 195 210 151 212 30 166
Circle -16777216 true false 215 106 30
flag
false
0
Rectangle -7500403 true true 60 15 75 300
Polygon -7500403 true true 90 150 270 90 90 30
Line -7500403 true 75 135 90 135
Line -7500403 true 75 45 90 45
flower
false
0
Polygon -10899396 true false 135 120 165 165 180 210 180 240 150 300 165 300 195 240 195 195 165 135
Circle -7500403 true true 85 132 38
Circle -7500403 true true 130 147 38
Circle -7500403 true true 192 85 38
Circle -7500403 true true 85 40 38
Circle -7500403 true true 177 40 38
Circle -7500403 true true 177 132 38
Circle -7500403 true true 70 85 38
Circle -7500403 true true 130 25 38
Circle -7500403 true true 96 51 108
Circle -16777216 true false 113 68 74