No duality in basic example (doesn't seem to work).

Author: SebKrantz

src/main/annealing.jl

@@ -37,7 +37,7 @@ Runs the simulated annealing method starting from network `I0`. Only sensible if
 # Examples
 ```julia
 # Nonconvex case, disabling automatic annealing
-param = init_parameters(K = 10, gamma = 2, annealing = false)
+param = init_parameters(K = 10, gamma = 2, annealing = false, duality = false)
 graph = create_graph(param)
 graph[:Zjn][61] = 10.0
 results = optimal_network(param, graph)

src/main/optimal_network.jl

@@ -21,7 +21,7 @@ Solve for the optimal network by solving the inner problem and the outer problem
 
 # Examples
 ```julia
-param = init_parameters(K = 10)
+param = init_parameters(K = 10, duality = false)
 graph = create_graph(param)
 graph[:Zjn][61] = 10.0
 results = optimal_network(param, graph)

src/main/plot_graph.jl

@@ -49,7 +49,7 @@ Plot a graph visualization with various styling options.
 
 # Examples
 ```julia
-param = init_parameters(K = 10)
+param = init_parameters(K = 10, duality = false)
 graph = create_graph(param)
 graph[:Zjn][51] = 10.0
 results = optimal_network(param, graph)