Skip to main content

Table 2 Dynamic community definition for an LDD graph, a better performance time of the algorithm in juxtaposition to the singular fastest path calculation (the beginning T)

From: Managing large distributed dynamic graphs for smart city network applications

tSourceCurrentPathTCurrentPath
0AACDFGIL29None
3AACDFGIL29f(D2)=10
9AACDEHIL26f(D2)=10, f(D3)=7
19 HHIJL26f(D3)=6
22 LNone26None
  1. 19,22 Are additional time datasets, elaborating the example given in Fig. 2