Skip to content
A Persistent Graph representation in Scala.
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
project
src
.gitignore
LICENSE.txt
README.md
build.sbt
sampleGraph.txt

README.md

PersistentGraph

A Persistent Graph representation in Scala.

The Graph is represented as a adjacency list. There is accompanying tests and some sample code.

I have also implemented a Krager Min-Cut implementation to find the min cut.

Future improvements

The algorithim can defenitely be made more efficient. Since it is a Persistent implementation it generates alot of objects. Future work would be to code the implementation/graph operations in a more efficient manner then return an immutable Graph object.

You can’t perform that action at this time.