diff --git a/README.md b/README.md
index b94b572..e3edb62 100644
--- a/README.md
+++ b/README.md
@@ -4,7 +4,7 @@ This project provides a simple implementation and example
 of finding the maximum flow of a network.
 
 This implements the Edmonds-Karp algorithm for Ford-Fulkerson
-using breadth-first search and an adjacency matrix representation
+using breadth-first search and an adjacency representation
 of the network.
 
 Utility class: MaxFlowExample
@@ -57,4 +57,12 @@ User has to create this array just to call the method.
 User manages memory for the algorithm: Poor "encapsulation".
 
 <hr>
-https://metrocs.github.io/NetworkFlow/
+Network Flow Example provides learners with a framework for experimenting with network flow algorithms.
+
+Copyright (c) 2026, Dr. Jody Paul
+
+This program is free software: you can redistribute it and/or modify it under the terms of the [GNU General Public License](LICENSE) as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.
+
+This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
+
+You should have received a copy of the GNU General Public License along with this program. If not, see [https://www.gnu.org/licenses/](https://www.gnu.org/licenses/).
diff --git a/_config.yml b/_config.yml
new file mode 100644
index 0000000..2b465c9
--- /dev/null
+++ b/_config.yml
@@ -0,0 +1,4 @@
+theme: jekyll-theme-slate
+title: Network Flow
+description: Network Flow Modeling for Algorithms and Algorithm Analysis
+repository: MetroCS/NetworkFlow