Yes, creating an adjacency list graph model would be straight forward. The most important thing is to keep as many operations in flight as possible, as the graph model is essentially a lot of distributed pointer chasing. If you’re interested in some help with your evaluation, you can send me an email to the address in my profile.
Happy to answer any questions about my talk, the conference, or FoundationDB in general.