Search Based Graph Algorithms

“图”，也称为“网络”，由一组节点和一组边组成，每条边连接一个特定的节点对。例如，考虑给定班级中学生的社交网络。课堂上的每个学生都是图/网络中的一个节点。连接节点对的边可以表示相互友谊，在这种情况下，边没有方向，或者单向友谊，在这种情况下，边是有方向的。给定这样一个友谊网络，我们可能希望找到朋友的“小团体”，即小团体中的每个人都是小团体中其他人的朋友的节点集。设计一个算法在图中找到这样一个团是计算机科学家的一个典型任务——希望这样的算法应该是高效和易于实现的。

A "graph", also called a "network" consists of a set of nodes together with a set of edges, each edge joining a particular pair of nodes. For example, consider a social network on students in a given class. Each student in the class is a node in the graph/network. The edges joining pairs of nodes could represent mutual friendship in which case the edges have no direction, or one directional friendship in which case the edges are directed. Given such a friendship network, we may wish to find "cliques" of friends, namely sets of nodes such that each person in the clique is a friend with everyone else in the clique. Designing an algorithm to find such a clique in a graph is a typical task for computer scientists - hopefully, such algorithms should be efficient and easy to implement.