class Vertex A vertex in the shortest path tree. More...

Annotated List  Files  Globals  Hierarchy  Index  Top

Public Methods

•  Vertex ()
• explicit  Vertex (const Neighbor& n)
• explicit  Vertex (const TwoHopNeighbor& n2)
• explicit  Vertex (const IPv4& main_addr)
• explicit  Vertex (const TopologyEntry& tc)
• inline bool  operator< (const Vertex& other) const
• inline bool  operator== (const Vertex& other) const
• inline void  set_main_addr (const IPv4& main_addr)
• inline IPv4  main_addr () const
• void  set_nodeid (uint32_t nid)
• uint32_t  nodeid () const
• void  set_is_origin (bool v)
• bool  is_origin () const
• void  set_producer (const IPv4& producer)
• IPv4  producer () const
• void  set_faceid (const OlsrTypes::FaceID fid)
• OlsrTypes::FaceID  faceid () const
• const LogicalLink*  link () const
• void  set_link (const LogicalLink* l)
• const TwoHopLink*  twohop_link () const
• void  set_twohop_link (const TwoHopLink* l2)
• void  set_type (const OlsrTypes::VertexType t)
• OlsrTypes::VertexType  type () const
• string  str () const

Detailed Description

[const]

Compare two Vertex instances for less-than ordering.

Collation order for sort: 1. Main address; always unique.

XXX The following two can't be relied upon... because differentiating them at all means we can't look up nodes purely by their address! 2. Is origin vertex: true, false. 3. Vertex type: origin, onehop, twohop, tc.

Parameters:

Returns: true if this node comes before the other node.

[const]

Compare two Vertex instances for equality.

Comparison is performed solely on the main address of the node, which is always unique.

Parameters:

Returns: true if this node and the other node are equal.

[const]

[const]

[const]

Returns: true if this node represents this router.

[const]

[const]

[const]

Returns: the LogicalLink associated with a one-hop neighbor.

[const]

Returns: the TwoHopLink associated with a two-hop neighbor.

[const]

[const]