[Feature Request] Graph partitioning in FGraph #50
Description
-
Graph partitioning refers to dividing a graph into smaller, non-overlapping subgraphs while optimizing some objective function or constraint.
-
It can be used to optimise graph reduction and fast component parting.
-
Since FGraph is based on a dictionary structure, graph partitioning can be based on dictionary partitioning.