Comment 7 for bug 725688

Just to add a comment regarding filter updating and performance. We had a similar problem in another application, and it is not very simple. If the filter listen to changes in the graph and updates it accordingly for each event, this could be a great performance problem in case of high event rate, and if the filter should analyze the entire graph in order to update.
In our case, we choose to redesign some of the filters to not analyze the entire graph for each event (for example, by updating only affected nodes when an edge is added), but I don't know if it would be as easy in Gephi.