g1.addEdge('M', 'N', 10)
g1.addEdge('N', 'P', 2)
print(g1.graph)
print ("Weight A -> B:")
print g1.weight('A', 'B')
print("Order")
print g1.order()
print("Degree of B:")
print g1.degree('B')
print("Get one vertex:")
print g1.oneVertex()
print("Get all vertices:")
print g1.vertices()
print("Get adjacents of B:")
print g1.adjacent('B')
print("searchCycle in this graph:")
print g1.searchCycle('A')
print("Predecessor of B")
print (g1.predecessor('B'))
print("Successor of B")
print(g1.successor('B'))
