Temporal BFS

Temporal breadth-first search (BFS) algorithm searches for associated vertices based on temporal message passing and temporal BFS algorithms, and outputs the visit time of each vertex and the distance from the vertex to the source start vertex. The procedure to use this algorithm is as follows:

1. In the Temporal tab of the Graph Analysis area on the left of the graph editor page, click Temporal BFS, and set the parameters in the drop-down list.
   • Set the start time, end time, and their properties. For details see Setting a Timeline. To modify the parameters, click in the lower left corner of the canvas.
   • Start Vertex: ID of the start vertex
   • k: Traversal depth, indicating the maximum number of vertices in a traversal. The value ranges from 1 to 100. The default value is 3.
   • Direction: Whether the traversal is performed along the directions of edges in the graph. The value can be true (default value) or false.
     • true: Traversal is performed along edge directions.
     • false: Edge directions will not be considered in the traversal.
   Figure 1 Temporal BFS
   
2. Click on the right of Temporal BFS. The running result is displayed on the canvas. In this algorithm, a single slider is used for playback. As shown in Figure 2 and Figure 3, the vertices in the dynamic graph are increases over time.
   Figure 2 Execution result 1
   
   Figure 3 Execution result 2