percolation | C code for 2D/3D lattice percolation

I am interested in identifying when different trips take place in a dataset. There are two lock states, where lock means the vehicle is stationary and unlocked means that the vehicle is being used.

As the same vehicle could be used by the same user multiple times, I first isolate the vehicle and a unique user through IDs and from a chronologically sorted time date column I can see when the vehicle was used. In order to identify different trips taken in the same vehicle by the same user I thought of identifying through my lock_state variable.

I've been trying to find how this could be done and percolation is something I came across but it seems too complex to understand and implement. I was wondering if there is an easier way of achieving this.

My end goal is to identify the number of trips (should be 2 in this example), add them to a new df alongside the user id and start/end datetimes (let's pretend all of this is the random column) and give them unique IDs. So the final output should be something like this (random made-up example):

Since the code is a lot of lines, I shall first show what the issue is:

I defined a simple loop and am getting the appropriate results.

Here when I attempt to plot it using matplotlib, the range shown on the x-axis is different from the range I inputted. I want 0 to 100 with a step size of 5 but I am getting 0 to 17.5 with a step size of 2.5.

Is there any issue with just the way I have coded this? If not, here is the rest of the code, thank you!:

(Python 3.9) I'm trying to solve a percolation problem/assignment, and just to start, I'm creating an n-by-n grid. While the grid looks correct on creation, when I try to alter a specific value inside the grid (in a nested list), it's assigning that value to every sublist, rather than only the list I'm referencing with it's index.

Here's the class and relevant bits:

I used the percolation class from the algs4.jar library, where you can simulate a whole labyrinth and see where the leaks are. I want to show the leaks that are from top to bottom, but now I get to see all of the leaks.

Does anyone know how I can see only the leaks that are percolations?

I thought maybe using dfs from the flow method in de Percolation.java class, and say something like only show when index i in rows is maxlength and marked but I don't really know how to say that, because I am not sure if this statement will show the entire leak of just the max length leak.

code I run AssignmentTwo.java:

I am experimenting with something called "bond percolation theory" Effectively you have some n by n lattice grid and then (randomly) with some probability p you keep or delete an edge. Here is an example:

Here is my code:

I have 2 questions for this fantastic community:

1. How do I get the grid I inserted to appear on all the integer values, so far it is only displaying on multiples of 5. (the thin grey lines)
2. I wish to have an algorithm that provides something called the "longest cluster" A cluster is a connected graph of edges (thick black lines) for example in the top left corner we have a cluster of 6 (upside down f shape) , a cluster of 2 (the little arrow head), a cluster of 4 (the square) and a cluster of 3 (the backwards upside L) The longest cluster is simply the longest one.

Any help is very appreciated. If I have posed this question badly please let me know or if any clarification is needed.