- Usage:
`F = filterGraphs(L, s)``F = filterGraphs(L, h)``F = filterGraphs(L, l)`

- Inputs:
`L`, a list, containing graphs (mixed formats are allowed)`s`, a string, a filter, as generated by buildGraphFilter`h`, a hash table, a filter, as used by buildGraphFilter`l`, a list, a filter, as used by buildGraphFilter

- Outputs:
`F`, a list, the graphs in*L*satisfying the filter

Filters the graphs in a list which satisfy certain restraints as given in the filter (see buildGraphFilter). Notice that the input list can be graphs represented as instances of the class Graph or in a nauty-based String format.

For example, we can filter for the connected graphs on five vertices.

i1 : L = generateGraphs 5; |

i2 : filterGraphs(L, {"Connectivity" => 0, "NegateConnectivity" => true}) o2 = {D?{, DCw, DC{, DEw, DEk, DE{, DFw, DF{, DQo, DQw, DQ{, DUW, DUw, DU{, ------------------------------------------------------------------------ DTw, DT{, DV{, D]w, D]{, D^{, D~{} o2 : List |

- buildGraphFilter -- creates the appropriate filter string for use with filterGraphs and countGraphs
- countGraphs -- counts the number of graphs in the list with given properties
- Example: Generating and filtering graphs

- filterGraphs(List,HashTable)
- filterGraphs(List,List)
- filterGraphs(List,String)