Here we first open the file in read mode from which we have to read the data and open the second file in write mode in which we head to write the data. Now we initiate a for loop to integrate over or not and if thei def copy_odd_lines(input_file, output_file): with open(input_file, ‘r’) as infile, …
How to copy odd lines of one file to another file in python Read More »
Given a directed graph G with N vertices and M edges. The task is to find the length of the longest directed path in graph. The time complexity of this approach is O(N2). Efficient Approach: An efficient approach is to use Dynamic programming and DFS together to find the longest path in the graph. def …
How to find Longest Path in a Directed Acyclic Graph in Python? Read More »
Given two line segments (p1,q1)and (p2,q2), find if the given line segments intersect with each other. Two segments (p1,q1) and (p2,q2) intersect if and only if one of the following two conditions is verified. 1.General case: -(p1,q1,p2) and (p1,q1,q2) have different orientations and -(p2,q2,p1) and (p2,q2,,q1) have different orientations. 2.Special case: -(p1,q1,p2) ,(p1,q1,q2),(p2,q2,p1) and (p2,q2,q1) …
How to check if two given line segments intersect in Python? Read More »