[Retracted] Vulnerability Digging for Software-Defined Network Controller Using Event Flow Graph Analysis

Algorithm 4

BFS-SubG().

	Inputs: the root node , G is an event flow graph, is the depth
	Outputs: is a subgraph with root node is and depth is d.
(1)	= [],  = []
(2)	visited.add(), .put(),  =  − 1
(3)	while >0,
(4)	node = .get()
(5)	neighbors = {ngb | ngb is neighbor of node}
(6)	for each in neighbors:
(7)	.add()
(8)	.put()
(9)	=  − 1