Skip to content
Snippets Groups Projects
Commit b1a63ac5 authored by Michal Patera's avatar Michal Patera
Browse files

Update dinitz.c

parent b6be416f
No related branches found
No related tags found
No related merge requests found
...@@ -25,7 +25,7 @@ void popHead(Node** head_ref) { ...@@ -25,7 +25,7 @@ void popHead(Node** head_ref) {
   
   
int BFS(int start, int end, double **graph, int *levels){ int BFS(int start, int end, double **graph, int *levels){
/*@ loop invariant 0 <= i <= end; /*@ loop invariant 0 <= i <= end + 1;
@ loop invariant \forall int j; 0 <= j < i ==> levels[j] == -1; @ loop invariant \forall int j; 0 <= j < i ==> levels[j] == -1;
@ loop assigns i, levels[0..end]; @ loop assigns i, levels[0..end];
@ loop variant end - i; @ loop variant end - i;
...@@ -44,7 +44,7 @@ int BFS(int start, int end, double **graph, int *levels){ ...@@ -44,7 +44,7 @@ int BFS(int start, int end, double **graph, int *levels){
while(queueHead != NULL){ while(queueHead != NULL){
cur = queueHead->data; cur = queueHead->data;
popHead(&queueHead); popHead(&queueHead);
/*@ loop invariant \forall int i; 0 <= i <= end ==> levels[i] >= -1 && levels[i] <= end; /*@ loop invariant \forall int i; 0 <= i <= end + 1 ==> levels[i] >= -1 && levels[i] <= end;
@ loop assigns queueHead, levels[0..end]; @ loop assigns queueHead, levels[0..end];
@*/ @*/
for (int i = 0; i <= end; ++i) { for (int i = 0; i <= end; ++i) {
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment