pygraf 1.02

Python Graph library

Supports:

Python:Python 2.6+

Author: [e-mail]

Install:

$ pip install pygraf

or

$ pip3 install pygraf

Command List:

• graph=pygraf.graf(n,mas)

• graph.check_orient()

• graph.dfs(v,0)

• graph.print_dfs()

• graph.comp(True/False)

• graph.minwayves_wihtout_cicly(v,u)

• graph.minwayprint_wihtout_cicly(v,u)

• graph.add_rebro(v,u,c)

• graph.del_rebro(v,u)

pygraf.graf(n,mas)

1. n - count of point

2. mas - massive of [First point,Second point,Cost]

Example init graph:

graph=pygraf.graf(3,[[1,2,2],[1,3,4]])

graph.check_orient()

Checking directed graph

Example init graph:

graph=pygraf.graf(3,[[1,2,2],[1,3,4]])
graph.check_orient()#return true - Directed; False - Undirected

graph.dfs(v,0)

Starting DFS algoritm from v-point

Example init graph:

graph=pygraf.graf(3,[[1,2,2],[2,3,4]])
graph.dfs(2,0)#Nothing return

graph.print_dfs()

Return result DFS algoritm from v-point

Example init graph:

graph=pygraf.graf(3,[[1,2,2],[2,3,4]])
graph.dfs(2,0)#Nothing return
print(graph.print_dfs())#print [False,True,True]

graph.comp(True/False)

Only for Undirected graph, if graph directed return False

if True:

Return Connected component and List all component:

graph=pygraf.graf(3,[[2,1],[2,3],[3,1],[1,3],[1,2],[3,2]])
print(graph.comp(True))#print "1->2" "1->3" "1"

if False:

graph=pygraf.graf(5,[[2,1],[2,3],[3,1],[1,3],[1,2],[3,2],[4,5],[5,4]])
print(graph.comp(False))#print "2"

graph.minwayves_wihtout_cicly(v,u)

Print min-cost from v to u

Example init graph:

graph=pygraf.graf(3,[[1,2,2],[2,3,4]])
graph.minwayves_wihtout_cicly(2,3)#print "4"

graph.minwayprint_wihtout_cicly(v,u)

Print min-cost from v to u

Example init graph:

graph=pygraf.graf(3,[[1,2,2],[2,3,4]])
graph.minwayprint_wihtout_cicly(2,3)#print "2 3"

graph.add_rebro(v,u,c)

Add path from “v” to “u” cost “c”

Example init graph:

graph=pygraf.graf(3,[[1,2,2],[2,3,4]])
graph.add_rebro(2,1,4)#add path from 2 to 1 cost 4

graph.del_rebro(v,u)

Delete path from “v” to “u”

Example init graph:

graph=pygraf.graf(3,[[1,2,2],[2,3,4]])
graph.del_rebro(2,3)#delete path from "2" to "3"