#GraphCast: Bandersnatch Edition

Welcome to this week’s #GraphCast – our new series featuring what you might have missed on the Neo4j YouTube channel.

Last week, our Editor-in-Chief, Bryce Merkl Sasaki, decided to get geeked on graph theory proof of Euler’s formula, which highlights the incredible math that underlies all graph technology. Undeniably very cool stuff, even if my addled writer brain commonly fails to process math.

Catch this week's GraphCast:  Bandersnatch Edition featuring decision trees.

This week, my #GraphCast selection is inspired by the recently released choose-your-own-adventure movie, “Black Mirror: Bandersnatch.” Love it or hate it, “Bandersnatch” was all about traversing parallel realities, containing five endings and a reported one trillion story combos. Whoa mama, that’s a whole lotta connected data.

Awesomely, at lightning speed multiple data nerds [spoiler] have already built flow charts that detail the movie’s decision trees and where they lead.

While watching and sweating over the movie’s decision points, I kept coming back to the graph database, as well as Max De Marzi’s insider insights on Running Decision Trees in Neo4j during his recent talk at GraphConnect 2018.

Watch this talk with Max for solutions to manage complex workflows and crazy business rules by using dynamic decision trees in Neo4j.

And watch “Bandersnatch,” and really all “Black Mirror” episodes, however horrifying, to ponder how our current actions have an impact on what the future will bring. (As all solid science fiction is wont to do).

Like this week’s #GraphCast?
Catch all our videos when you subscribe to the Neo4j YouTube channel, updated weekly with tons of graph tech goods.

Subscribe Me