GraphTheory - Maple Programming Help

Online Help

All Products    Maple    MapleSim


Home : Support : Online Help : Mathematics : Discrete Mathematics : Graph Theory : GraphTheory Package : GraphTheory/BipartiteMatching

GraphTheory

  

BipartiteMatching

 

Calling Sequence

Parameters

Description

Examples

Calling Sequence

BipartiteMatching(G)

Parameters

G

-

undirected unweighted bipartite graph

Description

• 

BipartiteMatching('G') returns the size of a maximum matching in a bipartite graph G. It also returns the set of edges of one maximum matching.

Examples

withGraphTheory:

GGraph1,2,2,3,3,4,3,8,4,5,5,6,6,7

G:=Graph 1: an undirected unweighted graph with 8 vertices and 7 edge(s)

(1)

BBipartiteMatchingG

B:=4,1,2,3,8,4,5,6,7

(2)

Draw the matching in red

HighlightEdgesG,B2

DrawGraphG,style=bipartite

See Also

DrawGraph

HighlightEdges

IsBipartite

 


Download Help Document

Was this information helpful?



Please add your Comment (Optional)
E-mail Address (Optional)
What is ? This question helps us to combat spam