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
In multi-relational networks where one relation is weighted/valued, the program interprets all relations as valued and uses Dijkstra algorithm for distances/indices computation.
This is usually not a problem, since it correctly computes the distances and centralities.
But there might be cases when this poses a problem. After all, it makes no sense to work on a binary relationship and have the program ask you every now and then what to do with the edge weights...
This is related to #53
The text was updated successfully, but these errors were encountered:
… help. New API method: GraphVertex::setDistanceSum(qreal) and GraphVertex::distanceSum(), they will be used in IRCC (and CC). TODO: fix the average distance subtle bug; subtle because it does not manifest because the relevant Graph method calls Graph::graphConnectedness() which in turn asks the distances to be recomputed without considering any edge weights! Reminder: graphConnectedness is a mess...
In multi-relational networks where one relation is weighted/valued, the program interprets all relations as valued and uses Dijkstra algorithm for distances/indices computation.
This is usually not a problem, since it correctly computes the distances and centralities.
But there might be cases when this poses a problem. After all, it makes no sense to work on a binary relationship and have the program ask you every now and then what to do with the edge weights...
This is related to #53
The text was updated successfully, but these errors were encountered: