Tech Stuff: Eulerian Trail. A recursive implementation of Hierholzer’s algorithm.
Jure Leskovec again.
This course will focus on how to analyze the structure and dynamics of large networks, how to model links, and how design algorithms that work with such large networks.
A key-value store with other data models and querying apis layered over top, so you can treat the same data as relational (with sql queries) and graph (with gremlin traversals) at the same time. WHAT. Indexes as a data model, like in document databases.
I am not crazy, or at least not the only one who is crazy enough to make up the same model. Yay?