Created
April 13, 2009 16:55
-
-
Save madx/94534 to your computer and use it in GitHub Desktop.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| while(!all_processed(processed, network->city_c)) { | |
| int u; | |
| Neighbor *tmp; | |
| u = extract_next(djk->marks, processed, network->city_c); | |
| processed[u] = true; | |
| tmp = network->cities[u]->neighbors; | |
| while(tmp != NULL) { | |
| int l; | |
| int v = tmp->city_id; | |
| travel = Travel_next(tmp->travel, djk->marks[u]%(24*60)); | |
| if (travel) { | |
| l = djk->marks[u] + travel->arrival - djk->marks[u]%(24*60); | |
| } else { | |
| travel = tmp->travel; | |
| l = djk->marks[u] + travel->arrival - djk->marks[u]%(24*60) + (24*60); | |
| } | |
| if (djk->marks[v] > l) { | |
| djk->marks[v] = l; | |
| djk->prev[v] = u; | |
| } | |
| tmp = tmp->next; | |
| } | |
| } |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment