5 Aug
2002
5 Aug
'02
4:40 p.m.
-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Hi, my former posting leads me to another question: How does the dijkstra_shortest_paths behave if applied to a multigraph? And how does the dijkstra_shortest_paths behave if applied to a filtered_(multi)graph containing parallel edges, but with only _one_ of the parallel edges visible respectively? Michael - -- http://www.ive.uni-hannover.de # kettner@ive.uni-hannover.de -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.0.6 (GNU/Linux) Comment: For info see http://www.gnupg.org iD8DBQE9TqprkCdGnb0kVFMRApGUAJ9nzr3Y4ijbrNnWENzxYIwcdLy8iQCfX2fx dl0M/IUt2bWFL0H9ovwajm4= =+FTJ -----END PGP SIGNATURE-----