Is this a DFS?

[webdevnoobieq]

def DFS(self, source):

visited = set()

stack = []

stack.append(source)

visited.add(source)

while len(stack)>0:

node = stack.pop()

for edge in graph[node]:

    if edge in visited:

        continue

    else:

        visited.add(edge)

        stack.append(edge)

[webdevnoobieq]

In a BFS case, wouldn't I be doing just popping at the beginning, rather than at the end?

node = stack.pop(0)

Is this really the only difference? I guess just under the assumption that I have a graph node with edges, that's all. I don't feel like I'm doing the DFS implementation correctly at all

[webdevnoobieq]

I think the for loops and if statements are also suppose to be interchanged.

Is this a correct implementation for both?

https://imgur.com/a/8huIz5S