User 3995 | 3/31/2016, 3:18:40 AM
I have run the single-source shortest-path algorithm (python code) on my local machine and it works amazing, and I have looked at the internal code which does the locking, partitioning etc at dato-code/how-to/SFrame/osssrc/sgraph/sgraphtriple_apply.cpp.
If I need to do something similar (e.g triangle counting/something which isn't implemented with dato presently), do I need to write the c++ code with all the partitioning/locking/?
PS : I have seen the sdk and have tried the basic addition and know how it works. I understand this is a newbie question, so hopefully I do get an answer!