QuEraComputing / UnitDiskMapping.jl

Reduce several arbitrary-connectivity optimization problems into maximum independent set problems on a grid
https://github.com/QuEraComputing/UnitDiskMapping.jl
Other
16 stars 3 forks source link

New example k23 #43

Open GiggleLiu opened 1 year ago

GiggleLiu commented 1 year ago

I used the same graph K23 as in arXiv:2209.03965. Although the DUGG looks the same, however, the mapping here is unweighted.

# output: a 7 x 11 DUGG
# ⋅ ● ⋅ ⋅ ⋅ ● ⋅ ⋅ ⋅ ⋅ ⋅ 
# ● ⋅ ● ● ● ⋅ ● ● ● ⋅ ⋅ 
# ⋅ ● ⋅ ⋅ ⋅ ● ⋅ ⋅ ⋅ ● ⋅ 
# ⋅ ● ⋅ ⋅ ⋅ ● ⋅ ⋅ ⋅ ● ⋅ 
# ⋅ ● ⋅ ⋅ ⋅ ● ⋅ ⋅ ⋅ ● ⋅ 
# ● ● ● ● ● ● ● ● ● ⋅ ● 
# ⋅ ● ⋅ ⋅ ⋅ ● ⋅ ⋅ ⋅ ● ⋅ 
codecov-commenter commented 1 year ago

Codecov Report

Merging #43 (253fe3f) into main (f9cfcc7) will not change coverage. The diff coverage is 100.00%.

@@           Coverage Diff           @@
##             main      #43   +/-   ##
=======================================
  Coverage   91.40%   91.40%           
=======================================
  Files          15       15           
  Lines        1407     1407           
=======================================
  Hits         1286     1286           
  Misses        121      121           
Impacted Files Coverage Δ
src/mapping.jl 96.08% <100.00%> (ø)

:mega: We’re building smart automated test selection to slash your CI/CD build times. Learn more

GiggleLiu commented 1 year ago

@Wang-Shengtao This is the 11 x 11 DUGG for K33

image

And this is the 11 x 15 DUGG for K34

image