Add latapy_clustering parallel algorithm in bipartite

[gulshan-123]

What does this PR change?

• Implement the latapy clustering of the bipartite graph as parallel.
• Also noticed a minor bug in timing script, where while ensuring the neighbour size >= 2, the resulting graph may not be bipartite.

Brief summary of changes (1–2 lines)

For the second issue, I've used the fact that nx.bipartite.random_graph partitions the nodes into two parts as follows:

• the first part has node indices 0..n-1
• the second part has node indices n..n+m-1

Additional comments/resources or notes for reviewers

https://networkx.org/documentation/stable/reference/algorithms/generated/networkx.algorithms.bipartite.generators.random_graph.html

EDIT:

• I have to edit process_chunk for tests to complete.

cc @Schefflera-Arboricola

---

(In future, I wish to complete #72 : parallel floyd warshall specifically)