Coloring node according to longest path leading to this node

[Regise]

Hey,

I am quite new to this exiting program. I have a directed acyclic graph with nodes of indegree=0 and nodes of indegree>0. My goal is to assign colors to all nodes, based on the longest path leading to them.
I have been looking online for a longest path function for gephi, but couldn’t find any yet. I hope to be able to assign attribute values to the nodes, based on the length of the longest path, leading to them and subsequently color the nodes according to those attributes.

I would appreciate your help.
Christian

[Regise]

Hey guys,

I am still highly interested in soving this problem. I would be glad about any hints.

Best regards,
Christian