This is the source code repository and issue tracker for Graph for Scala.
Questions or any feedback are appreciated. Please use GitHub issues for proven issues or enhancement requests but not for questions.
You are also welcome as a co-contributor.
Have fun with Graph for Scala.
Peter
1.x started in 2011. It has evolved by paying high attention to version compatibility.
2.x started in 2019 to make some significant improvements that also need new, simplified signatures. New features include
- multiple sources for directed hyperedges
- easy edge class definition using case classes thus easy definition of ADTs of edges
- improved functional graph handling.
Shipment is due shortly after Scala 2.13.11 is published because this fix will help to further simplify user code.
- Complete migration of random graphs for 2.x.
- Investigate whether and how the JSON module should be retained and migrated to 2.x or dropped. Migrate it if needed.
- Remove internal
Stateby possibly also changing node references to IDs. - Add support for algorithms by enrichment that use fluent properties.
- Reimplement immutable graphs to be based on a persistent data structure.