We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent fa10b9a commit dbb06f6Copy full SHA for dbb06f6
Seminars/sem_14/README.md
@@ -45,6 +45,8 @@
45
- При използването на *Binary Heap* сложността е *O(E\*logV)*.
46
47
```python
48
+from heapq import heappush, heappop
49
+
50
def prim(start, V, graph):
51
visited = set()
52
pq = [(0, start)]
0 commit comments