sssp

single-source shortest-paths via the Bellman-Ford algorithm More...

Collaboration diagram for sssp:

Functions
template<typename t >
bool	Bellman_Ford (Matrix< t > A, Vector< t > P, int n)
int	sssp (int n, World &dw)
char *	getCmdOption (char **begin, char **end, const std::string &option)
int	main (int argc, char **argv)

Detailed Description

single-source shortest-paths via the Bellman-Ford algorithm

Function Documentation

template<typename t >

bool Bellman_Ford	(	Matrix< t >	A,
		Vector< t >	P,
		int	n
	)

Definition at line 15 of file sssp.cxx.

Referenced by sssp().

char* getCmdOption	(	char **	begin,
		char **	end,
		const std::string &	option
	)

Definition at line 94 of file sssp.cxx.

Referenced by main().

int main	(	int	argc,
		char **	argv
	)

Definition at line 105 of file sssp.cxx.

References getCmdOption(), ctf.core::np(), ctf.core::rank(), and sssp().

int sssp	(	int	n,
		World &	dw
	)

Definition at line 33 of file sssp.cxx.

References ctf.core::a, ctf.core::b, Bellman_Ford(), CTF::World::rank, and CTF::Tensor< dtype >::write().

Referenced by main().