def compute_longest_path_tasks(bpmn_graph):
    """

    :param bpmn_graph:
    """
    incoming_flows_list_param_name = "incoming"

    nodes = copy.deepcopy(bpmn_graph.get_nodes())
    no_incoming_flow_nodes = []
    for node in nodes:
        incoming_list = node[1][incoming_flows_list_param_name]
        if len(incoming_list) == 0:
            no_incoming_flow_nodes.append(node)

    longest_path = []
    for node in no_incoming_flow_nodes:
        (all_nodes, qualified_nodes) = find_longest_path_tasks([], [], node, bpmn_graph)
        if len(qualified_nodes) > len(longest_path):
            longest_path = qualified_nodes
    return longest_path, len(longest_path)
def compute_longest_path_tasks ( bpmn_graph ) : incoming_flows_list_param_name = "incoming" nodes = copy . deepcopy ( bpmn_graph . get_nodes ( ) ) no_incoming_flow_nodes = [ ] for node in nodes : incoming_list = node [ 1 ] [ incoming_flows_list_param_name ] if len ( incoming_list ) == 0 : no_incoming_flow_nodes . append ( node ) longest_path = [ ] for node in no_incoming_flow_nodes : ( all_nodes , qualified_nodes ) = find_longest_path_tasks ( [ ] , [ ] , node , bpmn_graph ) if len ( qualified_nodes ) > len ( longest_path ) : longest_path = qualified_nodes return longest_path , len ( longest_path )
:param bpmn_graph: