From a3e705658e6d0657b15b04dff4d61dea8fe63c0c Mon Sep 17 00:00:00 2001
From: Ed Scheinerman <ers@jhu.edu>
Date: Tue, 25 Sep 2018 10:26:24 -0400
Subject: [PATCH] Test and thanks

---
 README.md        | 7 +++++++
 test/runtests.jl | 5 +++++
 2 files changed, 12 insertions(+)

diff --git a/README.md b/README.md
index b3d68d2..5958ebc 100644
--- a/README.md
+++ b/README.md
@@ -36,6 +36,11 @@ extensive information pertaining to the `SimpleGraph` type.
 The `SimpleDigraph` type is not so well developed nor documented. See the
 source files in the `src` directory.
 
+## Thanks
+
+Thank you to JHU students Tara Abrishami and Laura Bao for contributions
+to this project.
+
 
 ## Please Help
 
@@ -44,4 +49,6 @@ can/should be added. If you're interested in contributing, please
 contact me. I'm especially interested in JHU undergraduates getting
 involved.
 
+
+
 Ed Scheinerman (ers@jhu.edu)
diff --git a/test/runtests.jl b/test/runtests.jl
index c7d3cd5..ba4b345 100644
--- a/test/runtests.jl
+++ b/test/runtests.jl
@@ -229,6 +229,11 @@ end
     @test diam(G) == 9
 end
 
+@testset "Strong Connectivity" begin
+    G = TorusDigraph(5,5)
+    @test is_strongly_connected(G)
+end
+
 @testset "Directed Matrices" begin
     G = RandomTournament(10)
     A = adjacency(G)