[Olsr-dev] OLSR neighbors => Adjacency list Representation?

[Henning Rogge]

On 06/05/2012 11:01 AM, Mahtab Hossain wrote:
> Dear Developers,
>
> Is the OLSR's neighbor table built upon Adjacency list of graph
> theory? That is, you hashed onto a vertex entry based on IP, and that
> entry will contain a linked list of pointers to all other vertices to
> which it has an edge?

The neighbor table just contains the neighbors of the local node. Its 
currently (in the stable branch) a hashtable, using the IP hash as the 
key for the corresponding data structure.

The 2-hop neighbor table is a little bit more complicated, because it 
contains the neighbors of the neighbors, but it also use a hashtable.

The link-set is just a linked list.

All of them will become an AVL trees in the future, using the IP as the key.

Henning Rogge

-- 
Diplom-Informatiker Henning Rogge , Fraunhofer-Institut für
Kommunikation, Informationsverarbeitung und Ergonomie FKIE
Kommunikationssysteme (KOM)
Neuenahrer Straße 20, 53343 Wachtberg, Germany
Telefon +49 228 9435-961,   Fax +49 228 9435 685
mailto:(spam-protected) http://www.fkie.fraunhofer.de
GPG: E1C6 0914 490B 3909 D944 F80D 4487 C67C 55EC CFE0



-------------- next part --------------
A non-text attachment was scrubbed...
Name: smime.p7s
Type: application/pkcs7-signature
Size: 6169 bytes
Desc: S/MIME Cryptographic Signature
URL: <http://lists.olsr.org/pipermail/olsr-dev/attachments/20120605/ebbe9e82/attachment.bin>