summaryrefslogtreecommitdiff
path: root/src/ipcpd/normal/graph.h
Commit message (Collapse)AuthorAgeFilesLines
* ipcpd: normal: Make routing a policySander Vrijders2017-05-151-53/+0
| | | | | | This makes the routing component into a policy since different approaches may exist to do this, depending on how high the rank of the DIF is.
* ipcpd: normal: Make graph undirectedSander Vrijders2017-03-291-1/+1
| | | | | | This turns the directed graph into an undirected one. Only one side of the flow creates an FSDB entry. The graph structure creates an edge object for every vertex involved when an edge is updated or removed.
* ipcpd: normal: Remove graph_add_edge operationSander Vrijders2017-03-281-5/+0
| | | | | | This removes the graph_add_edge operation of the graph component. The routing component now only listens to RO_MODIFY events, and updates the graph accordingly.
* ipcpd: normal: Add routing table calculationSander Vrijders2017-03-231-16/+7
| | | | | | This adds routing table calculation to the graph component. The routing instances can then periodically ask the graph component for the routing table, and update their PFFs accordingly.
* ipcpd: normal: Add graph structureSander Vrijders2017-03-141-0/+67
This adds a graph structure which will be updated by routing when it is notified about a new RIB event. The routing can then use this graph as input for calculating the shortest path to a destination.