def compute_longest_path(bpmn_graph):
incoming_flows_list_param_name = "<STR_LIT>"<EOL>nodes = copy.deepcopy(bpmn_graph.get_nodes())<EOL>no_incoming_flow_nodes = []<EOL>for node in nodes:<EOL><INDENT>incoming_list = node[<NUM_LIT:1>][incoming_flows_list_param_name]<EOL>if len(incoming_list) == <NUM_LIT:0>:<EOL><INDENT>no_incoming_flow_nodes.append(node)<EOL><DEDENT><DEDENT>longest_path = []<EOL>for node in no_incoming_flow_nodes:<EOL><INDENT>(output_path, output_path_len) = find_longest_path([], node, bpmn_graph)<EOL>if output_path_len > len(longest_path):<EOL><INDENT>longest_path = output_path<EOL><DEDENT><DEDENT>return longest_path, len(longest_path)<EOL>
:param bpmn_graph: