Hi,<div><br></div><div>I was wondering if the max_cardinality_matching functions is defined for <i>directed</i> graphs as suggested by the documentation example [0]? I am asking, because the linked boost reference [1]&nbsp;describes&nbsp;the matching only for <i>undirected</i> graphs.</div><div><br></div><div>I am trying to get the "driver nodes" of a network as described by [2]. The authors showed, that the amount of "driver nodes needed to maintain full control of the network is determined by the ‘maximum matching’ in the network". May be even anyone has seen an implementation of this approach somewhere?</div><div><br></div><div>[0]&nbsp;http://projects.skewed.de/graph-tool/doc/flow.html#graph_tool.flow.max_cardinality_matching</div><div>[1]&nbsp;http://www.boost.org/doc/libs/1_48_0/libs/graph/doc/maximum_matching.html</div><div>[2]&nbsp;<span class="Apple-style-span" style="line-height: 18px; ">Liu, Y.-Y., Slotine, J.-J., &amp; Barabási, A.-L. (2011). Controllability of complex networks. </span><i style="line-height: 18px; ">Nature</i><span class="Apple-style-span" style="line-height: 18px; ">, </span><i style="line-height: 18px; ">473</i><span class="Apple-style-span" style="line-height: 18px; ">(7346), 167–173. doi:10.1038/nature10011&nbsp;</span></div><div><span class="Apple-style-span" style="line-height: 18px; "><br></span></div><div><span class="Apple-style-span" style="line-height: 18px; ">Thanks,</span></div><div><span class="Apple-style-span" style="line-height: 18px; ">&nbsp;Matthias</span></div>