Wolfram Language Paclet Repository

Community-contributed installable additions to the Wolfram Language

Primary Navigation

    • Cloud & Deployment
    • Core Language & Structure
    • Data Manipulation & Analysis
    • Engineering Data & Computation
    • External Interfaces & Connections
    • Financial Data & Computation
    • Geographic Data & Computation
    • Geometry
    • Graphs & Networks
    • Higher Mathematical Computation
    • Images
    • Knowledge Representation & Natural Language
    • Machine Learning
    • Notebook Documents & Presentation
    • Scientific and Medical Data & Computation
    • Social, Cultural & Linguistic Data
    • Strings & Text
    • Symbolic & Numeric Computation
    • System Operation & Setup
    • Time-Related Computation
    • User Interface Construction
    • Visualization & Graphics
    • Random Paclet
    • Alphabetical List
  • Using Paclets
    • Get Started
    • Download Definition Notebook
  • Learn More about Wolfram Language

NetworkXLink

Guides

  • Overview
  • Algorithms
  • Random Graphs

Symbols

  • WolframExternalFunctions`NetworkXLink`RandomGraph
  • AllNodeCuts
  • ApproximateCurrentFlowBetweennessCentrality
  • AsynchronousFluidCommunities
  • AsynchronousLPACommunities
  • AttractingComponents
  • BetweennessCentralitySubset
  • BiadjacencyMatrix
  • Bipartite$AverageClustering
  • Bipartite$BetweennessCentrality
  • Bipartite$ClosenessCentrality
  • Bipartite$Clustering
  • Bipartite$ConfigurationModel
  • Bipartite$DegreeCentrality
  • Bipartite$Density
  • CollaborationWeightedProjectedGraph
  • Color
  • CommunicabilityBetweennessCentrality
  • Communicability
  • CompleteToChordalGraph
  • CoreNumber
  • CurrentFlowBetweennessCentrality
  • CurrentFlowBetweennessCentralitySubset
  • CurrentFlowClosenessCentrality
  • DegreeMixingMatrix
  • DirectedJointDegreeGraph
  • Dispersion
  • DualBarabasiAlbertGraph
  • DuplicationDivergenceGraph
  • EdgeBetweennessCentralitySubset
  • EdgeCurrentFlowBetweennessCentrality
  • EdgeCurrentFlowBetweennessCentralitySubset
  • EquitableColor
  • ExpectedDegreeGraph
  • ExtendedBarabasiAlbertGraph
  • FindAsteroidalTriple
  • FindInducedNodes
  • FromBiadjacencyMatrix
  • GaussianRandomPartitionGraph
  • GeneralizedDegree
  • GeneralRandomIntersectionGraph
  • GeographicalThresholdGraph
  • GlobalReachingCentrality
  • GNCGraph
  • GNGraph
  • GnmkRandomGraph
  • GNRGraph
  • GreedyColor
  • GroupBetweennessCentrality
  • GroupByAnnotation
  • GroupClosenessCentrality
  • GroupDegreeCentrality
  • GroupInDegreeCentrality
  • GroupOutDegreeCentrality
  • HarmonicCentrality
  • IncrementalClosenessCentrality
  • InterCommunityEdges
  • IntraCommunityEdges
  • IsAsteroidalTripleFree
  • IsAttractingComponent
  • IsBipartiteNodeSet
  • IsChordal
  • IsPartition
  • IsSemiconnected
  • JointDegreeGraph
  • KComponents
  • KCorona
  • KCrust
  • KEdgeAugmentation
  • KernighanLinBisection
  • KRandomIntersectionGraph
  • KShell
  • KTruss
  • LabelPropagationCommunities
  • LFRBenchmarkGraph
  • LocalReachingCentrality
  • LukesPartitioning
  • MakeMaxCliqueGraph
  • MinimumWeightFullMatching
  • MinWeightedDominatingSet
  • MoralGraph
  • NavigableSmallWorldGraph
  • NodeRedundancy
  • OnionLayers
  • OnionSpectrum
  • OverlapWeightedProjectedGraph
  • PartialDuplicationGraph
  • PartitionQuality
  • PercolationCentrality
  • PlantedPartitionGraph
  • PowerLawClusterGraph
  • PreferentialAttachmentGraph
  • ProjectedGraph
  • ProminentGroup
  • PythonSeedRandom
  • PythonSession
  • RandomClusteredGraph
  • RandomCograph
  • RandomInternetASGraph
  • RandomKOutGraph
  • RandomLobster
  • RandomPartitionGraph
  • RandomPowerLawTree
  • RandomRegularGraph
  • RandomShellGraph
  • RelaxedCavemanGraph
  • RobinsAlexanderClustering
  • ScaleFreeGraph
  • SecondOrderCentrality
  • Sets
  • SpectralBipartivity
  • SpectralGraphForge
  • SquareClustering
  • SteinerTree
  • StochasticBlockModel
  • SubgraphCentrality
  • TravelingSalesmanProblem
  • TreewidthDecomposition
  • TrophicIncoherenceParameter
  • TrophicLevels
  • UniformRandomIntersectionGraph
  • UsePythonSession
  • VoteRank
  • WeightedProjectedGraph
WolframExternalFunctions`NetworkXLink`
MinimumWeightFullMatching
​
MinimumWeightFullMatching
[g]
returns a minimum weight full matching of the bipartite graph
g
.
​
Details

Examples  
(4)
Basic Examples  
(1)
Create a pseudorandom weighted bipartite graph:
In[1]:=
SeedRandom[1];
In[2]:=
g=nx`RandomGraph[3,5,.4,"Seed"123,EdgeWeight{_RandomInteger[{1,10}]},GraphLayout"BipartiteEmbedding",VertexLabelsAutomatic,EdgeLabels"EdgeWeight"]
Out[2]=
Find a minimum-weight full matching:
In[3]:=
MinimumWeightFullMatching
[g]
Out[3]=
06,17,23,60,71,32
Matched edges:
In[4]:=
KeyValueMap[UndirectedEdge,%]
Out[4]=
{06,17,23,60,71,32}
Highlight:
In[5]:=
HighlightGraph[g,%,GraphHighlightStyle{"Thick"}]
Out[5]=
Options  
(1)

Properties & Relations  
(2)

SeeAlso
FindIndependentEdgeSet
▪
FindMinimumCostFlow
RelatedLinks
▪
NetworkX
""

© 2025 Wolfram. All rights reserved.

  • Legal & Privacy Policy
  • Contact Us
  • WolframAlpha.com
  • WolframCloud.com