Remove some docstrings.

Author: SebKrantz

src/main/annealing.jl

@@ -514,12 +514,10 @@ function shake_network(param, graph, I0, results, options)
 end
 
 
-"""
-    rebranch_network(param, graph, I0, results, options)
 
-This function implements the rebranching algorithm described in the paper.
-Links are reshuffled everywhere so that each node is better connected to its best neighbor
-(those with the lowest price index for traded goods, i.e., more central places in the trading network).
+# This function implements the rebranching algorithm described in the paper.
+# Links are reshuffled everywhere so that each node is better connected to its best neighbor
+# (those with the lowest price index for traded goods, i.e., more central places in the trading network).
 """
 function rebranch_network(param, graph, I0, results, options)
     J = graph.J
@@ -558,12 +556,9 @@ function rebranch_network(param, graph, I0, results, options)
 end
 
 
-"""
-    random_rebranch_network(param, graph, I0, results, options)
 
-This function does the same as `rebranch_network` except that only a few nodes
-(#num_random_perturbations) are selected for rebranching at random.
-"""
+# This function does the same as `rebranch_network` except that only a few nodes
+# (#num_random_perturbations) are selected for rebranching at random.
 function random_rebranch_network(param, graph, I0, results, options)
     J = graph.J