1. The
way the algorithm decides if it can travel through an edge is checking the initial capacity of the edge and substracting it with the residual capacity of the edge (the amount of flow that has moved through it). If this value is greater than zero, this is the amount that can flow through it at each time. Initially each edge has a residual value of 0, so an untravelled edge has the capacity of 1
We had a bonus assignment on the data structures and algorithms course at university, to find out the amount of different routes Uolevi (a recurring character in our earlier assignments) could walk through a square shaped park
We had a bonus assignment on the data structures and algorithms course at university, to find out the amount of different routes Uolevi (a recurring character in our earlier assignments) could walk through a square shaped park
I had three examns, first the basics of databases on Monday, then the first of two introduction to university math examns on Wednesday and finally on Friday the first of two data structures and algorithms examns
Kommentit
Kirjaudu sisään tai Rekisteröidy ja kirjoita kommentti.