Skip to content

Commit 4602838

Browse files
committed
Fix test failing in 1.0 due to different vector display
1 parent 600c3de commit 4602838

File tree

1 file changed

+3
-8
lines changed

1 file changed

+3
-8
lines changed

docs/src/tutorial_graphs.md

Lines changed: 3 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -74,9 +74,7 @@ julia> ne(cities)
7474
2
7575
7676
julia> collect(edges(cities))
77-
2-element Vector{Graphs.SimpleGraphs.SimpleEdge{Int64}}:
78-
Edge 1 => 2
79-
Edge 1 => 3
77+
(Edge 1 => 2, Edge 1 => 3)
8078
8179
julia> has_edge(cities, 1, 2)
8280
true
@@ -104,11 +102,8 @@ Since `cities` is a weighted graph, we can leverage the whole Graphs.jl machiner
104102
julia> diameter(cities)
105103
1222
106104
107-
julia> ds = dijkstra_shortest_paths(cities, 2); ds.dists
108-
3-element Vector{Int64}:
109-
344
110-
0
111-
1222
105+
julia> ds = dijkstra_shortest_paths(cities, 2); Tuple(ds.dists)
106+
(344, 0, 1222)
112107
```
113108

114109
Finally, let us remove some edges and vertices

0 commit comments

Comments
 (0)