This shows you the differences between two versions of the page.
notes:net:allp [2017/07/22 17:42] vlado |
notes:net:allp [2017/07/22 17:42] (current) vlado |
||
---|---|---|---|
Line 5: | Line 5: | ||
In exploring the best way to make the preprint transformation I constucted in May 2012 an {{notes:pdf:allpaths.pdf|all paths semiring}} (see also [[http://vlado.fmf.uni-lj.si/vlado/papers/SemiRingSNA.pdf|S1]],[[https://link.springer.com/referenceworkentry/10.1007/978-1-4614-6170-8_152|S2]]). In its original version it doesn't consider cycles. They can be obtained as the diagonal values of the matrix R*C. | In exploring the best way to make the preprint transformation I constucted in May 2012 an {{notes:pdf:allpaths.pdf|all paths semiring}} (see also [[http://vlado.fmf.uni-lj.si/vlado/papers/SemiRingSNA.pdf|S1]],[[https://link.springer.com/referenceworkentry/10.1007/978-1-4614-6170-8_152|S2]]). In its original version it doesn't consider cycles. They can be obtained as the diagonal values of the matrix R*C. | ||
- | {{notes:pics:allpaths1.png}} | + | {{notes:pics:allpaths1.png?250}} |
Here is an implementation of the all-paths semiring in Python (I changed from 2012 list representation to set representation, and I included into paths multiplication also cycles): | Here is an implementation of the all-paths semiring in Python (I changed from 2012 list representation to set representation, and I included into paths multiplication also cycles): |