(#2) Add tables for the example to make the problem more clear

Author: jbytecode

paper/paper.bib

@@ -43,7 +43,7 @@ @misc{gurobi-optimods
 
 @misc{Graphs2021,
   author       = {Fairbanks, James and Besan{\c{c}}on, Mathieu and Simon, Sch{\"o}lly and Hoffiman, J{\'u}lio and Eubank, Nick and Karpinski, Stefan},
-  title        = {JuliaGraphs/Graphs.jl: an optimized graphs package for the Julia programming language},
+  title        = {JuliaGraphs/Graphs.jl: an optimized graphs package for the {J}ulia programming language},
   year         = 2021,
   url = {https://github.com/JuliaGraphs/Graphs.jl/}
 }

paper/paper.md

@@ -38,9 +38,20 @@ Although the majority of computations are performed by the HiGHS optimizer [@HiG
 
 # An Example
 
-The example below defines a linear transportation problem with a given matrix 
-of transportation costs between sources and targets, demand vector of targets, and 
-supply vector of sources. 
+The example shown in **Table 1** defines a linear transportation problem with a given matrix 
+of transportation costs between three sources and four targets, demand values of targets, and 
+supply values of sources. 
+
+|           | Target 1  | Target 2  | Target 3  | Target 4  |  Supply  |
+| :-------- | :-------: | :-------: | :-------: | :-------: | :------: |
+| Source 1  | 1         | 5         | 7         | 8         | 100      |
+| Source 2  | 2         | 6         | 4         | 9         | 100      |
+| Source 3  | 3         | 10        | 11        | 12        | 200      |
+| Demand    | 100       | 100       | 100       | 100       |          |
+
+Table: Example transportation problem
+
+The Julia formulation of the problem is given below.
 
 ```Julia
 julia> problem = TransportationProblem(
@@ -64,6 +75,17 @@ julia> result.solution
 [0.0 100.0 0.0 0.0; 0.0 0.0 100.0 0.0; 100.0 -0.0 -0.0 100.0]
 ```
 
+The `solution` matrix represents the amounts sent from the sources to corresponding targets. **Table 2** represents the problem with its solution:
+
+|           | Target 1  | Target 2  | Target 3  | Target 4  |  Supply  |
+| :-------- | :-------: | :-------: | :-------: | :-------: | :------: |
+| Source 1  | 1         | 5  (100)  | 7         | 8         | 100      |
+| Source 2  | 2         | 6         | 4 (100)   | 9         | 100      |
+| Source 3  | 3  (100)  | 10        | 11        | 12 (100)  | 200      |
+| Demand    | 100       | 100       | 100       | 100       |          |
+
+Table: Example transportation problem with its solution
+
 # Acknowledgements
 
 Our deepest appreciation goes to the Julia core and package developers for creating such a powerful computational tool and supportive environment.