Skip to content

Update AdjacencyList branch from main #1

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
jody wants to merge 2 commits into
base: AdjacencyList
Choose a base branch
from
Open

Update AdjacencyList branch from main #1

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
300e4a3
Add initial configuration for Jekyll site
jody May 24, 2026
a69c122
Revise README for clarity and licensing details
jody May 24, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
12 changes: 10 additions & 2 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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
Expand Down Expand Up @@ -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/).
4 changes: 4 additions & 0 deletions _config.yml
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,4 @@
theme: jekyll-theme-slate
title: Network Flow
description: Network Flow Modeling for Algorithms and Algorithm Analysis
repository: MetroCS/NetworkFlow
Loading