Skip to content

Commit 3c6d4c1

Browse files
committed
add
1 parent a503693 commit 3c6d4c1

File tree

5 files changed

+57
-62
lines changed

5 files changed

+57
-62
lines changed

Diff for: src/.gitignore

+1
Original file line numberDiff line numberDiff line change
@@ -0,0 +1 @@
1+
**/test*

Diff for: src/graph/test.py

-33
This file was deleted.

Diff for: src/graph/邻接矩阵实现图.py

+23
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,23 @@
1+
class Graph:
2+
def __init__(self, num_vertices):
3+
self.num_vertices = num_vertices
4+
self.graph = [[0 for _ in range(num_vertices)] for _ in range(num_vertices)]
5+
6+
def add_edge(self, vertex1, vertex2):
7+
self.graph[vertex1][vertex2] = 1
8+
self.graph[vertex2][vertex1] = 1
9+
10+
def display_graph(self):
11+
for row in self.graph:
12+
print(row)
13+
14+
# 创建一个图实例
15+
g = Graph(4)
16+
17+
# 添加边
18+
g.add_edge(0, 1)
19+
g.add_edge(0, 2)
20+
g.add_edge(1, 3)
21+
22+
# 显示图的邻接矩阵
23+
g.display_graph()

Diff for: src/graph/邻接表实现图.py

+33
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,33 @@
1+
class Graph:
2+
def __init__(self):
3+
self.graph = {}
4+
5+
def add_vertex(self, vertex):
6+
if vertex not in self.graph:
7+
self.graph[vertex] = []
8+
9+
def add_edge(self, vertex1, vertex2):
10+
if vertex1 in self.graph and vertex2 in self.graph:
11+
self.graph[vertex1].append(vertex2)
12+
self.graph[vertex2].append(vertex1)
13+
14+
def display_graph(self):
15+
for vertex in self.graph:
16+
print(vertex, "->", " -> ".join(self.graph[vertex]))
17+
18+
# 创建一个图实例
19+
g = Graph()
20+
21+
# 添加顶点
22+
g.add_vertex('A')
23+
g.add_vertex('B')
24+
g.add_vertex('C')
25+
g.add_vertex('D')
26+
27+
# 添加边
28+
g.add_edge('A', 'B')
29+
g.add_edge('A', 'C')
30+
g.add_edge('B', 'D')
31+
32+
# 显示图
33+
g.display_graph()

Diff for: src/sorting/test.py

-29
This file was deleted.

0 commit comments

Comments
 (0)