درس ۵ سطح متوسط: ساختارهای داده پیشرفته در پایتون (Heap, Graph, Trie)

import heapq

# Min-Heap (کوچک‌ترین اول)
heap = []
heapq.heappush(heap, 5)
heapq.heappush(heap, 1)
heapq.heappush(heap, 9)
heapq.heappush(heap, 3)

print(heapq.heappop(heap))  # خروجی: ۱
print(heapq.heappop(heap))  # خروجی: ۳

tasks = []
heapq.heappush(tasks, (3, "تمرین پایتون"))
heapq.heappush(tasks, (1, "خرید نون"))
heapq.heappush(tasks, (2, "تماس با مامان"))

while tasks:
    priority, task = heapq.heappop(tasks)
    print(f"اولویت {priority}: {task}")

class Graph:
    def __init__(self):
        self.graph = {}
    
    def add_edge(self, u, v):
        if u not in self.graph:
            self.graph[u] = []
        self.graph[u].append(v)
        # برای گراف بدون جهت:
        if v not in self.graph:
            self.graph[v] = []
        self.graph[v].append(u)

g = Graph()
g.add_edge("علی", "مریم")
g.add_edge("علی", "رضا")
g.add_edge("مریم", "سارا")
print(g.graph)

def dfs(graph, start, visited=None):
    if visited is None:
        visited = set()
    visited.add(start)
    print(start)
    for neighbor in graph.get(start, []):
        if neighbor not in visited:
            dfs(neighbor, visited)

dfs(g.graph, "علی")

class TrieNode:
    def __init__(self):
        self.children = {}
        self.is_end = False

class Trie:
    def __init__(self):
        self.root = TrieNode()
    
    def insert(self, word):
        node = self.root
        for char in word:
            if char not in node.children:
                node.children[char] = TrieNode()
            node = node.children[char]
        node.is_end = True
    
    def search(self, word):
        node = self.root
        for char in word:
            if char not in node.children:
                return False
            node = node.children[char]
        return node.is_end

trie = Trie()
trie.insert("سلام")
trie.insert("سلامتی")
print(trie.search("سلام"))    # True
print(trie.search("خداحافظ")) # False

class MovieRecommender:
    def __init__(self):
        self.graph = {}
    
    def add_user(self, user):
        self.graph[user] = {}
    
    def add_rating(self, user, movie, rating):
        if user not in self.graph:
            self.add_user(user)
        self.graph[user][movie] = rating
    
    def suggest(self, user, threshold=4):
        suggestions = {}
        friends = self.graph[user].keys()
        
        for friend in friends:
            for movie, rating in self.graph[friend].items():
                if movie not in self.graph[user] and rating >= threshold:
                    suggestions[movie] = suggestions.get(movie, 0) + rating
        
        return sorted(suggestions.items(), key=lambda x: x[1], reverse=True)[:5]

recommender = MovieRecommender()
recommender.add_rating("علی", "تایتانیک", 5)
recommender.add_rating("علی", "ماتریکس", 4)
recommender.add_rating("مریم", "تایتانیک", 3)
recommender.add_rating("مریم", "اینسپشن", 5)

print("پیشنهاد برای علی:", recommender.suggest("علی"))