Skip to content

Commit

Permalink
fix notebook and bump version
Browse files Browse the repository at this point in the history
  • Loading branch information
GiggleLiu committed Jan 4, 2023
1 parent 4f6c635 commit e5bac7d
Show file tree
Hide file tree
Showing 3 changed files with 5 additions and 4 deletions.
2 changes: 1 addition & 1 deletion Project.toml
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
name = "UnitDiskMapping"
uuid = "1b61a8d9-79ed-4491-8266-ef37f39e1727"
authors = ["QuEra Computing Inc."]
version = "0.3.0"
version = "0.3.1"

[deps]
Graphs = "86223c79-3864-5bf0-83f7-82e725a168b6"
Expand Down
1 change: 1 addition & 0 deletions notebooks/Project.toml
Original file line number Diff line number Diff line change
Expand Up @@ -5,3 +5,4 @@ LinearAlgebra = "37e2e46d-f89d-539d-b4ee-838fcccc9c8e"
LuxorGraphPlot = "1f49bdf2-22a7-4bc4-978b-948dc219fbbc"
PlutoSliderServer = "2fc8631c-6f24-4c5b-bca7-cbb509c42db4"
Revise = "295af30f-e4ad-537b-8983-00126c2a3abe"
UnitDiskMapping = "1b61a8d9-79ed-4491-8266-ef37f39e1727"
6 changes: 3 additions & 3 deletions notebooks/tutorial.jl
Original file line number Diff line number Diff line change
@@ -1,5 +1,5 @@
### A Pluto.jl notebook ###
# v0.19.12
# v0.19.19

using Markdown
using InteractiveUtils
Expand Down Expand Up @@ -64,7 +64,7 @@ md"Let the source graph be the Petersen graph."
graph = smallgraph(:petersen)

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

# ╔═╡ 417b18f6-6a8f-45fb-b979-6ec9d12c6246
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."
Expand All @@ -87,7 +87,7 @@ md"The field `grid_graph` is the mapped grid graph."

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

# ╔═╡ 96ca41c0-ac77-404c-ada3-0cdc4a426e44
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.
Expand Down

0 comments on commit e5bac7d

Please sign in to comment.