fix typos

Author: jbytecode

README.md

@@ -30,7 +30,7 @@ julia> Pkg.add("OperationsResearchModels")
 - [Minimum Spanning Tree](https://jbytecode.github.io/OperationsResearchModels.jl/dev/algorithms/#Minimum-Spanning-Tree)
 - [p-median for Location Selection](https://jbytecode.github.io/OperationsResearchModels.jl/dev/algorithms/#pmedian)
 - [CPM - Critical Path Method](https://jbytecode.github.io/OperationsResearchModels.jl/dev/algorithms/#CPM-(Critical-Path-Method))
-- [PERT - Project Evaluation and Review Technique](https://jbytecode.github.io/OperationsResearchModels.jl/dev/algorithms/#PERT-(Project-Evalutation-and-Review-Technique))
+- [PERT - Project Evaluation and Review Technique](https://jbytecode.github.io/OperationsResearchModels.jl/dev/algorithms/#PERT-(Project-Evaluation-and-Review-Technique))
 - [The Knapsack Problem](https://jbytecode.github.io/OperationsResearchModels.jl/dev/algorithms/#Knapsack)
 - [Johnson's Rule for Flow-Shop Scheduling](https://jbytecode.github.io/OperationsResearchModels.jl/dev/algorithms/#Johnson's-Rule)
 - [Flow-shop Scheduling using Permutation Encoded Genetic Algorithms (using a Random Key Genetic Algorithm)](https://jbytecode.github.io/OperationsResearchModels.jl/dev/algorithms/#Genetic-Algorithm-for-the-problems-that-cannot-be-solved-with-using-Johnson's-Rule)

docs/src/algorithms.md

@@ -46,7 +46,7 @@ OperationsResearchModels.CpmActivity
 ```
 
 
-## PERT (Project Evalutation and Review Technique)
+## PERT (Project Evaluation and Review Technique)
 ```@docs
 OperationsResearchModels.solve(problem::PertProblem)
 ```

docs/src/index.md

@@ -4,6 +4,6 @@
 The OperationsResearchModels package includes basic Operations Research subjects such as Transportation Problem, Assignment Problem, Minimum Spanning Tree, Shortest Path, Maximum Flow, 
 and p-medians method for selecting location of facilities. 
 
-Package content is incrementaly updated.
+Package content is incrementally updated.
 
 Please refer the Algorithms section for the detailed documentation. 

src/cpm.jl

@@ -116,11 +116,11 @@ function earliestfinishtime(activity::CpmActivity)
     return maximum(v) + activity.time
 end
 
-function longestactivity(activies::Vector{CpmActivity})::CpmActivity
+function longestactivity(activities::Vector{CpmActivity})::CpmActivity
     activity = CpmActivity("", -1, CpmActivity[])
     maxval = typemin(Float64)
 
-    for a in activies
+    for a in activities
         ea = earliestfinishtime(a)
         if ea > maxval
             maxval = ea

test/testassignment.jl

@@ -1,6 +1,6 @@
 @testset "Assignment Problem" verbose = true begin
 
-    @testset "Simple Assigment Problem" begin
+    @testset "Simple Assignment Problem" begin
         mat = [
             4 8 1
             3 1 9