How to calculate the Jain’s fairness index in routing?
6 Ansichten (letzte 30 Tage)
Ältere Kommentare anzeigen
I have network structure G = (V,E) with vertex set V, edge set E. The vertices are representing nodes and an edge connects two nodes. The edge values are positive and there is no self loops. I have differnt routing paths. how to calculate the each routing path jain index?
0 Kommentare
Antworten (0)
Siehe auch
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!