文中把最大流最小割算法应用于无线传感网络的事件检测中，针对边沿陡峭的事件，设计事件区域检测算法( G-Cut) ． 该算法首先将相邻节点的传感数据转化为权值，形成流网络; 利用最大流最小割算法切割流网络，获得事件边界; 再根据上传信息隐含的方向，确定事件区域． 以野外火灾为例进行仿真实验，结果表明: 文中算法事件检测准确度高，节点计算量低; 针对多事件区域，在不增加节点计算量和通信量的情况下，仍可保证其检测准确度．

In this paper,the max-flow /min-cut algorithm is applied to the event detection in wireless sensor networks,and an event detection algorithm ( G-Cut) is proposed for boundary-abrupt events.In the algorithm,firstly,the sensing data of adjacent nodes are transformed into weight values,and thus a flow network is formed.Then,the event boundary is obtained by using the max-flow /min-cut algorithm to cut the flow network.Finally,the event area is determined according to the direction implied in upload information.Simulation results on wildfire events show that the proposed algorithm achieves a high accuracy of event detection with a small computation amount of nodes,and for multi-event regions,it can guarantee the detection accuracy without increasing the computation amount and traffic of nodes.