I’m writing readability in python for CS50, and I’ve tried so many different Coleman liau index formulas but it still will not work no matter what I do. My letter, word and sentence counters are giving me the correct output. I’ve been trying for hours to the point where I just copied and pasted an algorithm I found still doesn’t
Tag: computer-science
Finding 2 least correlating/similar lists in a list of lists
I have a list of paths taken from networkX by nx.shortest_simple_paths(g,s,d) and the paths are: What I am trying to do is to find two paths which are the least similar to each other, the disjointpaths in networkX does not always return two paths in my case and I need exactly two. Answer nx.disjointpaths finds paths that do not share