[Networkit] Bachelor-Project about generic semiring operators

Christian Staudt christian.staudt at kit.edu
Mon Jun 27 16:18:47 CEST 2016


> On 27 Jun 2016, at 16:00, Thomas Schmidt <thomas.3.schmidt at uni-konstanz.de> wrote:
> 
> 
> I started tying to work it out and found that we would still need to
> use a template to handle those arbitrary edge weights. My proposal would
> be to turn SSSP into a template class SSSP<T>, where we replace the
> occurences of the type edgeweight with T, if it makes sense. This way,
> SSSP<double> would be the single source shortest path class as it is
> now (maybe a rename of SSSP<T> would be needed then?).
> Further, I would change the Dijkstra class' constructor to also take the
> list of edge weights, as well as the relax function as a parameter.
> 
> In a similar fashion, I would then also implement the Bellman-Ford
> algorithm.
> 
> Any thoughts on that matter? I am not very experienced with C++, so any
> input would be very appreciated.


Sounds right to me, I would have to see some code to spot any errors.

Have you thought about how this new functionality will be available on the Python layer? It should, but it doesn’t have to be a 1:1 mapping of the underlying C++. We can help with the mapping.

Chris
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.ira.uni-karlsruhe.de/pipermail/networkit/attachments/20160627/339148ed/attachment.html>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 495 bytes
Desc: Message signed with OpenPGP using GPGMail
URL: <http://lists.ira.uni-karlsruhe.de/pipermail/networkit/attachments/20160627/339148ed/attachment.sig>


More information about the NetworKit mailing list