Renato Westphal 75aa7aa135 isisd: add abiliy to compute the reverse shortest path tree ... RFC 7490 says: "The reverse SPF computes the cost from each remote node to root. This is achieved by running the normal SPF algorithm but using the link cost in the direction from the next hop back towards root in place of the link cost in the direction away from root towards the next hop". Support for reverse SPF will be necessary later as it's one of the algorithms used to compute R-LFA/TI-LFA repair paths. Signed-off-by: Renato Westphal <renato@opensourcerouting.org>		2020-08-26 20:16:19 -03:00
..
bgpd	*: record transaction based on control flag	2020-08-20 14:12:04 -07:00
helpers	*: record transaction based on control flag	2020-08-20 14:12:04 -07:00
isisd	isisd: add abiliy to compute the reverse shortest path tree	2020-08-26 20:16:19 -03:00
lib	*: record transaction based on control flag	2020-08-20 14:12:04 -07:00
ospf6d	build: non-recursive tests	2018-09-08 21:26:54 +02:00
topotests	Merge pull request #5799 from pguibert6WIND/flowspec_ipv6	2020-08-26 08:26:46 -04:00
.gitignore	tests, isisd: add IS-IS SPF unit tests	2020-08-26 20:16:19 -03:00
Makefile	build: non-recursive tests	2018-09-08 21:26:54 +02:00
pytest.ini	tests: Exclude topotests from consideration	2018-11-27 20:22:10 -05:00
runtests.py	tests: add pytest testrunners	2017-02-13 17:43:47 +01:00
subdir.am	tests, isisd: add IS-IS SPF unit tests	2020-08-26 20:16:19 -03:00