Skip to content

Commit 0c20edb

Browse files
GiggleLiuGiggleLiu
committed
update docs
1 parent 5aebd06 commit 0c20edb

File tree

6 files changed

+12
-24
lines changed

6 files changed

+12
-24
lines changed

‎examples/Coloring.jl‎

Lines changed: 2 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1,11 +1,9 @@
11
# # Coloring problem
22

33
# !!! note
4-
# This tutorial only covers the coloring problem specific features,
5-
# It is recommended to read the [Independent set problem](@ref) tutorial too to know more about
4+
# It is recommended to read the [Independent set problem](@ref) tutorial first to know more about
65
# * how to optimize the tensor network contraction order,
7-
# * what are the other graph properties computable,
8-
# * how to select correct method to compute graph properties,
6+
# * what graph properties are available and how to select correct method to compute graph properties,
97
# * how to compute weighted graphs and handle open vertices.
108

119
# ## Problem definition

‎examples/Matching.jl‎

Lines changed: 2 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1,11 +1,9 @@
11
# # Vertex matching problem
22

33
# !!! note
4-
# This tutorial only covers the vertex matching problem specific features,
5-
# It is recommended to read the [Independent set problem](@ref) tutorial too to know more about
4+
# It is recommended to read the [Independent set problem](@ref) tutorial first to know more about
65
# * how to optimize the tensor network contraction order,
7-
# * what are the other graph properties computable,
8-
# * how to select correct method to compute graph properties,
6+
# * what graph properties are available and how to select correct method to compute graph properties,
97
# * how to compute weighted graphs and handle open vertices.
108

119
# ## Problem definition

‎examples/MaxCut.jl‎

Lines changed: 2 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1,11 +1,9 @@
11
# # Cutting problem (Spin-glass problem)
22

33
# !!! note
4-
# This tutorial only covers the cutting problem specific features,
5-
# It is recommended to read the [Independent set problem](@ref) tutorial too to know more about
4+
# It is recommended to read the [Independent set problem](@ref) tutorial first to know more about
65
# * how to optimize the tensor network contraction order,
7-
# * what are the other graph properties computable,
8-
# * how to select correct method to compute graph properties,
6+
# * what graph properties are available and how to select correct method to compute graph properties,
97
# * how to compute weighted graphs and handle open vertices.
108

119
# ## Problem definition

‎examples/MaximalIS.jl‎

Lines changed: 2 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1,11 +1,9 @@
11
# # Maximal independent set problem
22

33
# !!! note
4-
# This tutorial only covers the maximal independent set problem specific features,
5-
# It is recommended to read the [Independent set problem](@ref) tutorial too to know more about
4+
# It is recommended to read the [Independent set problem](@ref) tutorial first to know more about
65
# * how to optimize the tensor network contraction order,
7-
# * what are the other graph properties computable,
8-
# * how to select correct method to compute graph properties,
6+
# * what graph properties are available and how to select correct method to compute graph properties,
97
# * how to compute weighted graphs and handle open vertices.
108

119
# ## Problem definition

‎examples/PaintShop.jl‎

Lines changed: 2 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1,11 +1,9 @@
11
# # Binary paint shop problem
22

33
# !!! note
4-
# This tutorial only covers the binary paint shop problem specific features,
5-
# It is recommended to read the [Independent set problem](@ref) tutorial too to know more about
4+
# It is recommended to read the [Independent set problem](@ref) tutorial first to know more about
65
# * how to optimize the tensor network contraction order,
7-
# * what are the other graph properties computable,
8-
# * how to select correct method to compute graph properties,
6+
# * what graph properties are available and how to select correct method to compute graph properties,
97
# * how to compute weighted graphs and handle open vertices.
108

119
# ## Problme Definition

‎examples/Satisfiability.jl‎

Lines changed: 2 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1,11 +1,9 @@
11
# # Satisfiability problem
22

33
# !!! note
4-
# This tutorial only covers the maximal independent set problem specific features,
5-
# It is recommended to read the [Independent set problem](@ref) tutorial too to know more about
4+
# It is recommended to read the [Independent set problem](@ref) tutorial first to know more about
65
# * how to optimize the tensor network contraction order,
7-
# * what are the other graph properties computable,
8-
# * how to select correct method to compute graph properties,
6+
# * what graph properties are available and how to select correct method to compute graph properties,
97
# * how to compute weighted graphs and handle open vertices.
108

119
# ## Problem definition

0 commit comments

Comments
 (0)