You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: docs/src/tutorials/warcraft.jl
+10-11Lines changed: 10 additions & 11 deletions
Original file line number
Diff line number
Diff line change
@@ -17,23 +17,23 @@ b = WarcraftBenchmark()
17
17
# This method takes as input the benchmark object for which the dataset is to be generated, and a second argument specifying the number of samples to generate:
18
18
dataset =generate_dataset(b, 50)
19
19
20
-
# We obtain an [`InferOptDataset`](@ref) object, which contains all needed data for the problem.
20
+
# We obtain a vector of [`DataSample`](@ref) object, which contains all needed data for the problem.
21
21
# Subdatasets can be created through regular slicing:
# In the case o fthe Warcraft benchmark, the method has an additioonal keyword argument to chose the algorithm to use: Dijkstra's algorithm or Bellman-Ford algorithm.
51
51
y =maximizer(θ)
52
52
# As we can see, currently the pipeline predicts random noise as cell weights, and therefore the maximizer returns a straight line path.
53
-
plot_data(b; features=x, costs=θ, solution=y)
53
+
plot_data(b, DataSample(; x, θ, y))
54
54
# We can evaluate the current pipeline performance using the optimality gap metric:
0 commit comments