Skip to content

Instantly share code, notes, and snippets.

@Youngestdev

Youngestdev/WeightedGraph.py

Created May 15, 2020 22:48
Show Gist options

  • Select an option

    Learn more about clone URLs
  • Save Youngestdev/f8cb6ad9461c8c8802e42941274a9e0f to your computer and use it in GitHub Desktop.

Select an option

Learn more about clone URLs
Save Youngestdev/f8cb6ad9461c8c8802e42941274a9e0f to your computer and use it in GitHub Desktop.
Download ZIP
Raw
WeightedGraph.py
class WeightedGraph:
pass
def DFS(self, i, visited):
v = self.graph[v]
idx = self.graph.index(v)
visited[idx] = True
print(v, end="")
for i in v:
if not visited[i]:
self.DFS(i, visited)
@lilpolymath
Copy link
Copy Markdown

lilpolymath commented May 15, 2020

Hmmm, doesn't look right somehow.

@Youngestdev
Copy link
Copy Markdown
Author

Youngestdev commented May 15, 2020

Oh yeah lol. That was the first idea. I’m not taking the weighted values into consideration.

@lilpolymath
Copy link
Copy Markdown

lilpolymath commented May 15, 2020

Alright.

@Youngestdev
Copy link
Copy Markdown
Author

Youngestdev commented May 16, 2020

Gotten an idea on how to go about it?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment