Skip to content

Commit e5bac7d

Browse files
committed
fix notebook and bump version
1 parent 4f6c635 commit e5bac7d

File tree

3 files changed

+5
-4
lines changed

3 files changed

+5
-4
lines changed

Project.toml

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
name = "UnitDiskMapping"
22
uuid = "1b61a8d9-79ed-4491-8266-ef37f39e1727"
33
authors = ["QuEra Computing Inc."]
4-
version = "0.3.0"
4+
version = "0.3.1"
55

66
[deps]
77
Graphs = "86223c79-3864-5bf0-83f7-82e725a168b6"

notebooks/Project.toml

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -5,3 +5,4 @@ LinearAlgebra = "37e2e46d-f89d-539d-b4ee-838fcccc9c8e"
55
LuxorGraphPlot = "1f49bdf2-22a7-4bc4-978b-948dc219fbbc"
66
PlutoSliderServer = "2fc8631c-6f24-4c5b-bca7-cbb509c42db4"
77
Revise = "295af30f-e4ad-537b-8983-00126c2a3abe"
8+
UnitDiskMapping = "1b61a8d9-79ed-4491-8266-ef37f39e1727"

notebooks/tutorial.jl

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
### A Pluto.jl notebook ###
2-
# v0.19.12
2+
# v0.19.19
33

44
using Markdown
55
using InteractiveUtils
@@ -64,7 +64,7 @@ md"Let the source graph be the Petersen graph."
6464
graph = smallgraph(:petersen)
6565

6666
# ╔═╡ 0302be92-076a-4ebe-8d6d-4b352a77cfce
67-
show_graph(graph; unit=50)
67+
LuxorGraphPlot.show_graph(graph; unit=50)
6868

6969
# ╔═╡ 417b18f6-6a8f-45fb-b979-6ec9d12c6246
7070
md"We can use the `map_graph` function to map the unweighted MIS problem on the Petersen graph to one on a defected King's graph."
@@ -87,7 +87,7 @@ md"The field `grid_graph` is the mapped grid graph."
8787

8888
# ╔═╡ 520fbc23-927c-4328-8dc6-5b98853fb90d
8989
# `unit` is the number of pixels per unit distance
90-
show_graph(unweighted_res.grid_graph)
90+
LuxorGraphPlot.show_graph(unweighted_res.grid_graph)
9191

9292
# ╔═╡ 96ca41c0-ac77-404c-ada3-0cdc4a426e44
9393
md"The field `lines` is a vector of copy gadgets arranged in a `⊢` shape. These copy gadgets form a *crossing lattice*, in which two copy lines cross each other whenever their corresponding vertices in the source graph are connected by an edge.

0 commit comments

Comments
 (0)