hmthanh

# Chain Responsibility Design Pattern Example in Python
from abc import abstractmethod


class LeaveRequest:
    def __init__(self, date: int):
        self.date = date

    def get(self) -> int:
        return self.date

hmthanh

FWIW: I didn't produce the content presented here (the outline from Edmond Lau's book). I've just copy-pasted it from somewhere over the Internet, but I cannot remember what exactly the original source is. I was also not able to find the author's name, so I cannot give him/her the proper credits.

---

Effective Engineer - Notes

• By Edmond Lau
• Highly Recommended 👍
• http://www.theeffectiveengineer.com/

What's an Effective Engineer?

hmthanh

{"lastUpload":"2020-02-06T07:49:37.695Z","extensionVersion":"v3.4.3"}

hmthanh

vector<int> pathS2E = vector<int>();
while (start != end){
    pathS2E.push_back(end);
    end = path[start][end];
}
pathS2E.push_back(start);
for (vector<int>::iterator i = pathS2E.end(); i != pathS2E.begin(); i--)
{
    cout << *(i-1) << " ";
}

hmthanh

for (int k = 0; k < length; k++) {
    for (int i = 0; i < length; i++) {
        for (int j = 0; j < length; j++) {
            if (dist[i][j] > dist[i][k] + dist[k][j]) {
                dist[i][j] = dist[i][k] + dist[k][j];
                path[i][j] = path[k][j];
            }
        }
    }
}

hmthanh

path = vector<vector<int>>(length, vector<int>(length));
dist = vector<vector<int>>(length, vector<int>(length));
for (int i = 0; i < length; i++) {
    for (int j = 0; j < length; j++) {
        dist[i][j] = graph[i][j];
        if (graph[i][j] != INF && i != j) {
            path[i][j] = i;
        }
        else {
            path[i][j] = -1;

hmthanh

graph = vector<vector<int>>(length, vector<int>(length));
for (int i = 0; i < length; i++){
    for (int j = 0; j < length; j++){
        file >> temp;
        if (temp == 0 && i != j) {
            graph[i][j] = INF;
        }
        else {
            graph[i][j] = temp;
        }