mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-11-27 23:11:09 +00:00
Code Issues Packages Projects Releases Wiki Activity

Added some examples.

Browse Source 
Added examples and comments for more readable code.
This commit is contained in:
A Safari 2018-12-14 10:31:45 +03:30 committed by GitHub
parent fa2eecdc30
commit 687af17d47
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 14 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
graphs/Directed (Weighted) Graph
View File

@ -5,12 +5,12 @@ import math as math
# the dfault weight is 1 if not assigend but all the implementation is weighted # the dfault weight is 1 if not assigend but all the implementation is weighted
class DirectedGraph: class DirectedGraph:
# enter True or False for this constructor
def __init__(self): def __init__(self):
self.graph = {} self.graph = {}
# adding vertices and edges # adding vertices and edges
# note that self loops are not supported in undirected simpl graphs but it is in multigraphs # adding the weight is optional
# handels repetition
def add_pair(self, u, v, w = 1): def add_pair(self, u, v, w = 1):
if self.graph.get(u): if self.graph.get(u):
if self.graph[u].count([w,v]) == 0: if self.graph[u].count([w,v]) == 0:
@ -19,6 +19,8 @@ class DirectedGraph:
self.graph[u] = [[w, v]] self.graph[u] = [[w, v]]
if not self.graph.get(v): if not self.graph.get(v):
self.graph[v] = [] self.graph[v] = []
# handels if the input does not exist
def remove_pair(self, u, v): def remove_pair(self, u, v):
if self.graph.get(u): if self.graph.get(u):
for _ in self.graph[u]: for _ in self.graph[u]:
@ -93,3 +95,13 @@ class DirectedGraph:
d.append(__[1]) d.append(__[1])
visited.append(__[1]) visited.append(__[1])
return visited return visited
if __name__ == "__main__":
g = DirectedGraph()
# add 50 random nodes to the graph
g.fill_graph_randomly(50)
# you can add or remove any edge and vertex
g.add_pair(3, 5)
g.remove_pair(3,5)
g.dfs()
g.bgs()