class AdjNode:
def __init__(self, data):
self.vertex = data
self.next = None
Size of the array will be the no. of the
# vertices "V"
class Graph:
def __init__(self, vertices):
self.V = vertices
self.graph = [None] * self.V
# Function to add an edge in an undirected graph
def add_edge(self, src, dest):
# Adding the node to the source node
node = AdjNode(dest)
#from here
node.next = self.graph[src]
self.graph[src] = node
#to here
node = AdjNode(src)
node.next = self.graph[dest]
self.graph[dest] = node
if __name__ == "__main__":
V = 5
graph = Graph(V)
graph.add_edge(0, 1)
graph.add_edge(0, 4)
graph.add_edge(1, 2)
graph.add_edge(1, 3)
graph.add_edge(1, 4)
graph.print_graph() 我不理解从这里到这里,部分在评论。请解释一下。我甚至试过python辅导视觉器。不过,其他的都明白了。此代码来自极客健忘页面https://www.geeksforgeeks.org/graph-and-its-representations/,任何帮助都将不胜感激。
发布于 2020-04-30 15:22:17
解释
所讨论的代码行是在链接列表的开头插入项的标准方法。
步骤
node = AdjNode(dest)node.next = self.graph[src] self.graph[src] = nodehttps://stackoverflow.com/questions/61524426
复制相似问题