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

t

Source

CurrentPath

T

CurrentPath

0

A

ACDFGIL

29

None

3

A

ACDFGIL

29

f(D2)=10

9

A

ACDEHIL

26

f(D2)=10, f(D3)=7

19 ∗

H

HIJL

26

f(D3)=6

22 ∗

L

None

26

None

  1. 19∗,22∗ Are additional time datasets, elaborating the example given in Fig. 2