 |
MaximalIndependentEdgeSet
MaximalIndepndentEdgeSet[g]
gives a maximal independent edge set of an undirected graph g.
更多信息
- To use
, you first need to load the Graph Utilities Package using Needs["GraphUtilities`"]. 
gives an approximate maximal set of pairwise nonadjacent edges of g.- A maximal independent edge set of a graph is also called a maximal matching.
- The following option can be given:
-
Weighted False whether edges with higher weights are preferred when forming the maximal independent edge set
