|
1 | 1 | using DataGraphs: DataGraph |
2 | | -using Graphs: Edge, grid, has_edge, has_vertex |
| 2 | +using Graphs: has_edge, has_vertex |
| 3 | +using NamedGraphs: NamedEdge |
| 4 | +using NamedGraphs.NamedGraphGenerators: named_grid |
3 | 5 |
|
4 | | -g = grid((4,)) |
5 | | -dg = DataGraph(g; vertex_data_eltype = String, edge_data_eltype = Symbol) |
6 | | -@show !isassigned(dg, Edge(1, 2)) |
| 6 | +g = named_grid((4)) |
| 7 | +dg = DataGraph(g; vertex_data_type = String, edge_data_type = Symbol) |
| 8 | +@show !isassigned(dg, NamedEdge(1, 2)) |
7 | 9 | @show !isassigned(dg, 1 => 2) |
8 | | -@show !isassigned(dg, Edge(1 => 2)) |
| 10 | +@show !isassigned(dg, NamedEdge(1 => 2)) |
9 | 11 | @show !isassigned(dg, 1 => 3) |
10 | 12 | @show !isassigned(dg, 1) |
11 | 13 | @show !isassigned(dg, 2) |
@@ -33,10 +35,10 @@ dg[4] = "V4" |
33 | 35 |
|
34 | 36 | dg[1 => 2] = :E12 |
35 | 37 | dg[2 => 3] = :E23 |
36 | | -dg[Edge(3, 4)] = :E34 |
| 38 | +dg[NamedEdge(3, 4)] = :E34 |
37 | 39 | #@show isassigned(dg, (1, 2)) |
38 | | -@show isassigned(dg, Edge(2, 3)) |
| 40 | +@show isassigned(dg, NamedEdge(2, 3)) |
39 | 41 | @show isassigned(dg, 3 => 4) |
40 | | -@show dg[Edge(1, 2)] == :E12 |
| 42 | +@show dg[NamedEdge(1, 2)] == :E12 |
41 | 43 | @show dg[2 => 3] == :E23 |
42 | 44 | @show dg[3 => 4] == :E34 |
0 commit comments