try modify src

Author: GiggleLiu

src/networks/Coloring.jl

@@ -2,8 +2,8 @@
     Coloring{K,CT<:AbstractEinsum} <: GraphProblem
     Coloring{K}(graph; openvertices=(), optimizer=GreedyMethod(), simplifier=nothing)
 
-[Vertex Coloring](https://psychic-meme-f4d866f8.pages.github.io/dev/tutorials/Coloring.html) problem.
-`optimizer` and `simplifier` are for tensor network optimization, check `optimize_code` for details.
+The [Vertex Coloring](https://psychic-meme-f4d866f8.pages.github.io/dev/tutorials/Coloring.html) problem.
+`optimizer` and `simplifier` are for tensor network optimization, check [`optimize_code`](@ref) for details.
 """
 struct Coloring{K,CT<:AbstractEinsum} <: GraphProblem
     code::CT

src/networks/IndependentSet.jl

@@ -6,7 +6,7 @@
 The [independent set problem](https://psychic-meme-f4d866f8.pages.github.io/dev/tutorials/IndependentSet.html) in graph theory.
 In the constructor, `weights` are the weights of vertices.
 `openvertices` specifies labels for the output tensor.
-`optimizer` and `simplifier` are for tensor network optimization, check `optimize_code` for details.
+`optimizer` and `simplifier` are for tensor network optimization, check [`optimize_code`](@ref) for details.
 """
 struct IndependentSet{CT<:AbstractEinsum,WT<:Union{UnWeighted, Vector}} <: GraphProblem
     code::CT

src/networks/Matching.jl

@@ -2,8 +2,8 @@
     Matching{CT<:AbstractEinsum} <: GraphProblem
     Matching(graph; openvertices=(), optimizer=GreedyMethod(), simplifier=nothing)
 
-[Vertex matching](https://psychic-meme-f4d866f8.pages.github.io/dev/tutorials/Matching.html) problem.
-`optimizer` and `simplifier` are for tensor network optimization, check `optimize_code` for details.
+The [Vertex matching](https://psychic-meme-f4d866f8.pages.github.io/dev/tutorials/Matching.html) problem.
+`optimizer` and `simplifier` are for tensor network optimization, check [`optimize_code`](@ref) for details.
 """
 struct Matching{CT<:AbstractEinsum} <: GraphProblem
     symbols::Vector{Tuple{Int,Int}}

src/networks/MaxCut.jl

@@ -3,9 +3,9 @@
     MaxCut(graph; weights=UnWeighted(), openvertices=(),
                 optimizer=GreedyMethod(), simplifier=nothing)
 
-[Cut](https://psychic-meme-f4d866f8.pages.github.io/dev/tutorials/MaxCut.html) problem (or spin glass problem).
+The [cutting](https://psychic-meme-f4d866f8.pages.github.io/dev/tutorials/MaxCut.html) problem (or spin glass problem).
 In the constructor, `weights` are the weights of edges.
-`optimizer` and `simplifier` are for tensor network optimization, check `optimize_code` for details.
+`optimizer` and `simplifier` are for tensor network optimization, check [`optimize_code`](@ref) for details.
 """
 struct MaxCut{CT<:AbstractEinsum,WT<:Union{UnWeighted, Vector}} <: GraphProblem
     code::CT

src/networks/MaximalIS.jl

@@ -3,8 +3,8 @@
     MaximalIS(graph; weights=UnWeighted(), openvertices=(),
                  optimizer=GreedyMethod(), simplifier=nothing)
 
-[Maximal independent set](https://psychic-meme-f4d866f8.pages.github.io/dev/tutorials/MaximalIS.html) problem. In the constructor, `weights` are the weights of vertices.
-`optimizer` and `simplifier` are for tensor network optimization, check `optimize_code` for details.
+The [maximal independent set](https://psychic-meme-f4d866f8.pages.github.io/dev/tutorials/MaximalIS.html) problem. In the constructor, `weights` are the weights of vertices.
+`optimizer` and `simplifier` are for tensor network optimization, check [`optimize_code`](@ref) for details.
 """
 struct MaximalIS{CT<:AbstractEinsum,WT<:Union{UnWeighted, Vector}} <: GraphProblem
     code::CT

src/networks/PaintShop.jl

@@ -4,6 +4,7 @@
              optimizer=GreedyMethod(), simplifier=nothing)
 
 The [binary paint shop problem](https://psychic-meme-f4d866f8.pages.github.io/dev/tutorials/PaintShop.html).
+`optimizer` and `simplifier` are for tensor network optimization, check [`optimize_code`](@ref) for details.
 
 Example
 -----------------------------------------