Skip to content

Commit 71b730b

Browse files
authored
Merge pull request #11 from SebKrantz/parameterized_graph
Parameterized graph
2 parents 80b12df + 868a6ae commit 71b730b

File tree

3 files changed

+19
-11
lines changed

3 files changed

+19
-11
lines changed

docs/src/api.md

Lines changed: 15 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -30,9 +30,22 @@ remove_node
3030

3131
# Documented Internal Functions
3232

33-
```@autodocs
33+
```@docs
34+
dict_to_namedtuple
35+
namedtuple_to_dict
36+
create_map
37+
create_square
38+
create_triangle
39+
create_custom
40+
represent_edges
41+
create_auxdata
42+
get_model
43+
```
44+
45+
<!-- ```@autodocs
46+
<!-- ```@autodocs
3447
Modules = [OptimalTransportNetworks]
3548
Public = false
3649
Private = true
3750
Order = [:function]
38-
```
51+
``` -->

src/main/annealing.jl

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -518,7 +518,6 @@ end
518518
# This function implements the rebranching algorithm described in the paper.
519519
# Links are reshuffled everywhere so that each node is better connected to its best neighbor
520520
# (those with the lowest price index for traded goods, i.e., more central places in the trading network).
521-
"""
522521
function rebranch_network(param, graph, I0, results, options)
523522
J = graph.J
524523

src/main/create_graph.jl

Lines changed: 4 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -253,10 +253,8 @@ Creates a triangular graph structure with width `w` and height `h`
253253
horizontal and along the two diagonals)
254254
255255
# Arguments
256-
- `w`: Width of graph (i.e. the max number of nodes along horizontal dimension),
257-
must be an integer
258-
- `h`: Height of graph (i.e. the max number of nodes along vertical dimension),
259-
must be an odd integer
256+
- `w`: Width of graph (i.e. the max number of nodes along horizontal dimension), must be an integer
257+
- `h`: Height of graph (i.e. the max number of nodes along vertical dimension), must be an odd integer
260258
"""
261259
function create_triangle(w, h)
262260
if h % 2 == 0
@@ -361,10 +359,8 @@ with width w and height h (nodes have 4 neighbors in total, along
361359
horizontal and vertical dimensions, NOT diagonals)
362360
363361
# Arguments
364-
- `w`: width of graph (ie. the number of nodes along horizontal
365-
dimension), must be an integer
366-
- `h`: height of graph (ie. the number of nodes along vertical
367-
dimension), must be an integer
362+
- `w`: width of graph (ie. the number of nodes along horizontal dimension), must be an integer
363+
- `h`: height of graph (ie. the number of nodes along vertical dimension), must be an integer
368364
"""
369365
function create_square(w, h)
370366
J = w * h

0 commit comments

Comments
 (0)