<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[mink2010的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/mink2010</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; mink2010]]></copyright><item><title><![CDATA[一种读者优先的读写锁的实现]]></title><link>https://blog.youkuaiyun.com/mink2010/article/details/51490707</link><guid>https://blog.youkuaiyun.com/mink2010/article/details/51490707</guid><author>mink2010</author><pubDate>Tue, 24 May 2016 15:56:54 +0800</pubDate><description><![CDATA[读写锁 rw_lock
互斥锁 mutex
自旋锁 spinlock
条件变量 condition_variable]]></description><category></category></item><item><title><![CDATA[一种读写公平的读写锁]]></title><link>https://blog.youkuaiyun.com/mink2010/article/details/51490605</link><guid>https://blog.youkuaiyun.com/mink2010/article/details/51490605</guid><author>mink2010</author><pubDate>Tue, 24 May 2016 15:26:26 +0800</pubDate><description><![CDATA[读写锁 rw_lock
互斥锁 mutex
自旋锁 spinlock
条件变量 condition_variable
内存栅栏 memory_order
原子操作 atomic]]></description><category></category></item><item><title><![CDATA[子图同构的Ullmann算法的matlab实现]]></title><link>https://blog.youkuaiyun.com/mink2010/article/details/26145061</link><guid>https://blog.youkuaiyun.com/mink2010/article/details/26145061</guid><author>mink2010</author><pubDate>Sun, 18 May 2014 13:58:03 +0800</pubDate><description><![CDATA[function r=Ullmann(a,b)


%Ullmann算法:子图同构算法中最简单的一种
%判断图b中是否有子图同构于a
%a和b是图的邻接布尔矩阵
%返回0代表没有找到,1代表找到了.


%p1和p2代表a和b的阶
    [p1,tmp]=size(a);
    [p2,tmp]=size(b);
    %ab必须都是方阵
    %p1
    ]]></description><category></category></item></channel></rss>