The differences between Degree and InDegree about graphmat

[narayanan2004]

The degree in PageRank is the out_degree i.e. the number of outgoing edges from a vertex. For topological sort, we need the in_degree (number of incoming edges at a vertex). This distinction is meaningful only for directed graphs. this->order specifies which edges the messages are sent to. It can be GraphMat::IN_EDGES, GraphMat::OUT_EDGES or GraphMat::ALL_EDGES.
To calculate the out_degree, we need to send a message from each vertex along its incoming edges and then sum up all the messages that reach a vertex. For example, if a graph is {1 -> 2, 1 -> 3}, then to calculate the out_degree of vertex 1 we need to receive a message from 2 & 3. Vice versa for in_degree.

Hope that helps.

[IslandGod]

I see , thank you for your response!