Easy Python Solution
Code
# Code
```python3 []
class Solution:
    def minMalwareSpread(self, graph: List[List[int]], initial: List[int]) -> int:
        n = len(graph)

        def dfs(node, exclude, visited):
            if node in visited or node == exclude:
                return
            visited.add(node)
            for neighbor in range(n):
                if graph[node][neighbor] == 1:
                    dfs(neighbor, exclude, visited)

        def calculate_spread(exclude):
            visited = set()
            for node in initial:
                if node != exclude:
                    dfs(node, exclude, visited)
            return len(visited)

        min_infected = float('inf')
        result = -1

        for node in sorted(initial):
            spread = calculate_spread(node)
            if spread < min_infected:
                min_infected = spread
                result = node

        return result
```
['Python3']