How To Catch Graphs With Linked Lists And Generics

about this session

Aleksandr Novikov

&

Friday
2:50 pm

In this talk you will learn about applying Scala to create a data structure for storing graphs, using generics to simplify unit testing. The code library has the following properties: the graph data structure is immutable and shrinkable, its first identifiers are stable, it preserves the order of arcs, and, although the graph is directed, both sources and targets are available. The project is called Hexagon. 

The code of the project is available on GitHub: https://github.com/mem-memov/binet/tree/master/src/main/scala/net/mem_memov/binet/hexagon

Aleksandr Novikov
Aleksandr Novikov

Our Sponsors

coralogixUMATRCondukorMatechsscalaCZivergeRock the JVMZIO
Nov 30 – Dec 1, 2023
London, UK
get your ticket