You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Thanks for the interests.
The graph is stored as a binary file. The format is for each line we store D+1 int64 number. The first number is the degree (the number of neighbour nodes), followed by D int64 numbers, which are the indices of the original data.
Of course, you can convert it to any format, only needs a little coding.
------------------ Original ------------------
From: Zhenlin Wu ***@***.***>
Date: Sat,Nov 4,2023 11:26 AM
To: ZJULearning/SSG ***@***.***>
Cc: Subscribed ***@***.***>
Subject: Re: [ZJULearning/SSG] Can we convert the ssg graph index into generalgraph format? (Issue #9)
Hi,
I am interested in your work and want to use ssg graph to my own implemented search algorithm.
I want to know this graph is stored? What is it data layout or looks like?
Can I convert it into a general graph format and dense matrix/ adjacent list/ CSR something like that?
—
Reply to this email directly, view it on GitHub, or unsubscribe.
You are receiving this because you are subscribed to this thread.Message ID: ***@***.***>
Hi,
I am interested in your work and want to use ssg graph to my own implemented search algorithm.
I want to know this graph is stored? What is it data layout or looks like?
Can I convert it into a general graph format and dense matrix/ adjacent list/ CSR something like that?
The text was updated successfully, but these errors were encountered: