Bayesian Network-Based Knowledge Graph Inference for Highway Transportation Safety Risks

Algorithm 1

	Input: training data , node sequence , positive integer ( denotes the number of parent nodes)
	Output:
	for i = 1 to n do
	start = true
	while start (true) anddo
	, it reaches the maximum node
	else Start = false
	end
	end
	where represents the nodes before and is a collection of parent nodes.