// calculate the primary eigenvector (eigenvector centrality) of a graph
m = [:]; c = 0; g.V.out.groupCount(m).loop(2){c++ < 1000} m.sort{a,b -> a.value
<=> b.value}
i would execute The script above from orient studiò (It does Not work ) And
mainly from c#
--
---
You received this message because you are subscribed to the Google Groups
"OrientDB" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
For more options, visit https://groups.google.com/d/optout.
