From c980a0ed5a35a77f748bc1f0b2295c00062dfc65 Mon Sep 17 00:00:00 2001 From: odow Date: Tue, 10 Sep 2024 17:26:16 +1200 Subject: [PATCH] Fix formattig --- docs/src/tutorials/linear/multi.jl | 24 ++++++++++++------------ 1 file changed, 12 insertions(+), 12 deletions(-) diff --git a/docs/src/tutorials/linear/multi.jl b/docs/src/tutorials/linear/multi.jl index a935f0017a9..07510655763 100644 --- a/docs/src/tutorials/linear/multi.jl +++ b/docs/src/tutorials/linear/multi.jl @@ -27,7 +27,6 @@ import SQLite: DBInterface import Tables import Test - # ## Formulation # The multi-commondity flow problem is a simple extension of @@ -179,16 +178,17 @@ demand = natural_join( # The SQLite queries can be arbitrarily complex. For example, here's a query # which builds every possible origin-destination pair: -od_pairs = DBInterface.execute( - db, - """ - SELECT a.location as 'origin', - b.location as 'destination' - FROM locations a - INNER JOIN locations b - ON a.type = 'origin' AND b.type = 'destination' - """, -) |> DataFrames.DataFrame +od_pairs = + DBInterface.execute( + db, + """ + SELECT a.location as 'origin', + b.location as 'destination' + FROM locations a + INNER JOIN locations b + ON a.type = 'origin' AND b.type = 'destination' + """, + ) |> DataFrames.DataFrame # With a constraint that we cannot send more than 625 units between each pair: @@ -207,4 +207,4 @@ solution_summary(model) # and obtain the solution: x.value = value.(x.value) -x[x.value .> 0, :] +x[x.value.>0, :]