Hoppers （dfs)

最新推荐文章于 2021-04-01 00:28:04 发布

Lyang0.0

最新推荐文章于 2021-04-01 00:28:04 发布

阅读量391

点赞数 1

分类专栏：暑假集训 dfs && bfs 文章标签：训练赛

本文链接：https://blog.csdn.net/qq_43588832/article/details/89791173

版权

这是一篇关于如何利用新型恶意软件'Hoppers'在有限的传播条件下感染高安全性的计算机网络的文章。网络由主机和双向连接组成。目标是通过最少的IT请求增加链接，使得从一个被感染主机出发能传播到所有主机。

摘要由CSDN通过智能技术生成

You are part of an elite hacking group who has just invented a new type of malware, called the hoppers. Hoppers can operate in any high-security computer networks; however, they can only propagate themselves in a very limited way.

A computer network is a set of hosts VV (|V|=N|V|=N) and direct links EE (|E|=M|E|=M). Each direct link connects two different hosts, allowing them to communicate in both directions. If a host uu is infected with a hopper, then it will propagate itself to all hosts WW where WW is the set of hosts which are connected to any neighbor of uu. Formally, W={w∣{(u,v),(v,w)}⊆E}W={w∣{(u,v),(v,w)}⊆E}. The newly-infected host wwcan now proceed to infect other hosts in the same manner.

You are trying to infect all hosts in a particular high-security network by compromising a single host. Of course, a compromised host will be infected with a hopper. Though it may be an impossible mission, you realize that you can trick the admini