RE: Dijkstra’s algorithm of finding optimal paths by lemouth

View this thread on: hive.blog | peakd.com | ecency.com

Viewing a response to: @krishtopa/dijkstra-s-algorithm-of-finding-optimal-paths

popularscience · @lemouth · Oct 15 '16

Are there other algorithms or is this one the most efficient one? I would like to have a look to the cpp code, but I cannot do that from my mobile.... will check tonight ;)

properties (22)

`author`	lemouth
`permlink`	re-krishtopa-dijkstra-s-algorithm-of-finding-optimal-paths-20161015t070959380z
`category`	popularscience
`json_metadata`	{"tags":["popularscience"]}
`created`	2016-10-15 07:10:03
`last_update`	2016-10-15 07:10:03
`depth`	1
`children`	2
`last_payout`	2016-11-15 01:27:24
`cashout_time`	1969-12-31 23:59:59
`total_payout_value`	0.000 HBD
`curator_payout_value`	0.000 HBD
`pending_payout_value`	0.000 HBD
`promoted`	0.000 HBD
`body_length`	172
`author_reputation`	338,011,164,701,274
`root_title`	"Dijkstra’s algorithm of finding optimal paths"
`beneficiaries`	`[]`
`max_accepted_payout`	1,000,000.000 HBD
`percent_hbd`	10,000
`post_id`	1,538,527
`net_rshares`	0

@krishtopa · Oct 18 '16

Hi, Lemouth.
I'm sorry for the late response.  Choice of the algorithm should depend on the specific application. If it's a single-source shortest path problem then Dijkstra's algorithm with Fibonacci heap is a best choice. If you need to find all pairs shortest paths, then you should rather use Floyd–Warshall algorithm

properties (22)

`author`	krishtopa
`permlink`	re-lemouth-re-krishtopa-dijkstra-s-algorithm-of-finding-optimal-paths-20161018t195949739z
`category`	popularscience
`json_metadata`	{"tags":["popularscience"]}
`created`	2016-10-18 19:59:51
`last_update`	2016-10-18 19:59:51
`depth`	2
`children`	1
`last_payout`	2016-11-15 01:27:24
`cashout_time`	1969-12-31 23:59:59
`total_payout_value`	0.000 HBD
`curator_payout_value`	0.000 HBD
`pending_payout_value`	0.000 HBD
`promoted`	0.000 HBD
`body_length`	321
`author_reputation`	48,350,480,258,009
`root_title`	"Dijkstra’s algorithm of finding optimal paths"
`beneficiaries`	`[]`
`max_accepted_payout`	1,000,000.000 HBD
`percent_hbd`	10,000
`post_id`	1,567,197
`net_rshares`	0

@lemouth · Oct 19 '16

Thanks! I always appreciate answers, even when late. We are all pretty busy and I can understand that, don't worry ^^

👍 krishtopa

`author`	lemouth
`permlink`	re-krishtopa-re-lemouth-re-krishtopa-dijkstra-s-algorithm-of-finding-optimal-paths-20161019t053352809z
`category`	popularscience
`json_metadata`	{"tags":["popularscience"]}
`created`	2016-10-19 05:34:03
`last_update`	2016-10-19 05:34:03
`depth`	3
`children`	0
`last_payout`	2016-11-15 01:27:24
`cashout_time`	1969-12-31 23:59:59
`total_payout_value`	0.000 HBD
`curator_payout_value`	0.000 HBD
`pending_payout_value`	0.000 HBD
`promoted`	0.000 HBD
`body_length`	117
`author_reputation`	338,011,164,701,274
`root_title`	"Dijkstra’s algorithm of finding optimal paths"
`beneficiaries`	`[]`
`max_accepted_payout`	1,000,000.000 HBD
`percent_hbd`	10,000
`post_id`	1,570,686
`net_rshares`	80,326,395,398
`author_curate_reward`	""

properties (23)vote details (1)

voter	weight	wgt%	rshares	pct	time
krishtopa	0 B		80,326,395,398	100%