Forwarded from پاکسازی متون
Designing Machine Learning Systems.pdf
6.6 MB
Designing Machine Learning Systems (2022)
#یادگیری_ماشین
برای دانلود کتابهای بیشتر در کانال عضو شوید
👇
🆔 @code_pedia
#یادگیری_ماشین
برای دانلود کتابهای بیشتر در کانال عضو شوید
👇
🆔 @code_pedia
Forwarded from پاکسازی متون
@maghalecomputer.pdf
25.6 MB
Forwarded from پاکسازی متون
Media is too big
VIEW IN TELEGRAM
Forwarded from پاکسازی متون
Machine Learning Bookcamp Build a portfolio of real-life pr.pdf
40 MB
Machine Learning Bookcamp (2021)
#یادگیری_ماشین
برای دانلود کتابهای بیشتر در کانال عضو شوید
👇
🆔 @code_pedia
#یادگیری_ماشین
برای دانلود کتابهای بیشتر در کانال عضو شوید
👇
🆔 @code_pedia
Forwarded from پاکسازی متون
Media is too big
VIEW IN TELEGRAM
کد الگوریتم دایجکسترا
class Graph():
def init(self, vertices):
self.V = vertices
self.graph = [[0 for column in range(vertices)]
for row in range(vertices)]
def printSolution(self, dist):
print("Vertex \t Distance from Source")
for node in range(self.V):
print(node, "\t\t", dist[node])
# A utility function to find the vertex with
# minimum distance value, from the set of vertices
# not yet included in shortest path tree
def minDistance(self, dist, sptSet):
# Initialize minimum distance for next node
min = 1e7
# Search not nearest vertex not in the
# shortest path tree
for v in range(self.V):
if dist[v] < min and sptSet[v] == False:
min = dist[v]
min_index = v
return min_index
# Function that implements Dijkstra's single source
# shortest path algorithm for a graph represented
# using adjacency matrix representation
def dijkstra(self, src):
dist = [1e7] * self.V
dist[src] = 0
sptSet = [False] * self.V
for cout in range(self.V):
# Pick the minimum distance vertex from
# the set of vertices not yet processed.
# u is always equal to src in first iteration
u = self.minDistance(dist, sptSet)
# Put the minimum distance vertex in the
# shortest path tree
sptSet[u] = True
# Update dist value of the adjacent vertices
# of the picked vertex only if the current
class Graph():
def init(self, vertices):
self.V = vertices
self.graph = [[0 for column in range(vertices)]
for row in range(vertices)]
def printSolution(self, dist):
print("Vertex \t Distance from Source")
for node in range(self.V):
print(node, "\t\t", dist[node])
# A utility function to find the vertex with
# minimum distance value, from the set of vertices
# not yet included in shortest path tree
def minDistance(self, dist, sptSet):
# Initialize minimum distance for next node
min = 1e7
# Search not nearest vertex not in the
# shortest path tree
for v in range(self.V):
if dist[v] < min and sptSet[v] == False:
min = dist[v]
min_index = v
return min_index
# Function that implements Dijkstra's single source
# shortest path algorithm for a graph represented
# using adjacency matrix representation
def dijkstra(self, src):
dist = [1e7] * self.V
dist[src] = 0
sptSet = [False] * self.V
for cout in range(self.V):
# Pick the minimum distance vertex from
# the set of vertices not yet processed.
# u is always equal to src in first iteration
u = self.minDistance(dist, sptSet)
# Put the minimum distance vertex in the
# shortest path tree
sptSet[u] = True
# Update dist value of the adjacent vertices
# of the picked vertex only if the current
Forwarded from پاکسازی متون
Yves-Hilpisch-Python-for-Finance_-Mastering-Data-Driven-Fina.pdf
6.2 MB
:Python for Finance: Mastering Data-Driven Finance Book
Author(s): Yves Hilpisch
Publisher: O'Reilly
Year: 2018
#پایتون
برای دانلود کتابهای بیشتر در کانال عضو شوید
👇
🆔 @code_pedia
Author(s): Yves Hilpisch
Publisher: O'Reilly
Year: 2018
#پایتون
برای دانلود کتابهای بیشتر در کانال عضو شوید
👇
🆔 @code_pedia
Forwarded from پاکسازی متون
This media is not supported in your browser
VIEW IN TELEGRAM
Forwarded from پاکسازی متون
This media is not supported in your browser
VIEW IN TELEGRAM
Forwarded from پاکسازی متون
I'm_ran_Ahmad_40_Algorithms_Every_Programmer_Should_Know_Hone_your.pdf
8.8 MB
40 Algorithms Every Programmer Should Know: Hone your problem-solving skills by learning different algorithms and their implementation in Python
40 الگوریتم که هر برنامه نویس باید بداند.
پیاده سازی با پایتون
جدید 2022 ⭐️⭐️⭐️
40 الگوریتم که هر برنامه نویس باید بداند.
پیاده سازی با پایتون
جدید 2022 ⭐️⭐️⭐️
Forwarded from پاکسازی متون
Media is too big
VIEW IN TELEGRAM