Network Influence Maximization in a Social Graph

[madhura-ingole]

Problem Statement: This problem involves maximizing the spread of influence in a directed social graph. Each person in the graph has an influence score, and influence spreads through directed edges. The challenge is to select a set of K people such that their influence reaches the maximum number of people, considering the influence flows through the graph.

Goal: Maximize the total influence score across the network by choosing K starting points.

[madhura-ingole]

@abhisek247767 assign me this issue under hacktoberfest label

[abhisek247767]

Assigned

[madhura-ingole]

Resolved in #53