1

More than 3 years have passed since last update.

# 組合せ最適化 - 典型問題 - 最大マッチング問題

Last updated at Posted at 2015-07-10

## 実行方法

usage
``````Signature: nx.max_weight_matching(G, maxcardinality=False)
Docstring:
Compute a maximum-weighted matching of G.

A matching is a subset of edges in which no node occurs more than once.
The cardinality of a matching is the number of matched edges.
The weight of a matching is the sum of the weights of its edges.
``````
python
``````# CSVデータ
import pandas as pd, networkx as nx, matplotlib.pyplot as plt
from ortoolpy import graph_from_table, networkx_draw
g = graph_from_table(tbn, tbe)[0]
for i, j in g.edges():
d = nx.max_weight_matching(g)
pos = networkx_draw(g)
nx.draw_networkx_edges(g, pos, width=3, edgelist=[(i, j) for i, j in d])
plt.show()
print(d)
``````

``````{5: 0, 0: 5, 4: 3, 3: 4, 2: 1, 1: 2}
``````

python
``````# pandas.DataFrame
from ortoolpy.optimization import MaxMatching
MaxMatching('data/edge0.csv')
``````
node1 node2 capacity weight
0 0 5 2 4
1 1 2 2 5
2 3 4 2 4
python
``````# 乱数データ
import networkx as nx, matplotlib.pyplot as plt
from ortoolpy import networkx_draw
g = nx.random_graphs.fast_gnp_random_graph(10, 0.3, 1)
d = nx.max_weight_matching(g)
pos = networkx_draw(g, nx.spring_layout(g))
nx.draw_networkx_edges(g, pos, width=3, edgelist=[(i, j) for i, j in d])
plt.show()
``````

## データ

Register as a new user and use Qiita more conveniently

1. You get articles that match your needs
2. You can efficiently read back useful information
3. You can use dark theme
What you can do with signing up
1