title: Link State Routing Implementation
body: <p>I 'm implementing a Link State Routing Protocol and I have some doubts.
  First of all, let me say that I am using a simple library that provides me the network topology, a router Class (that doesn't obviously provide me the routing protocol), and message Class.</p>
  
  <p>My goal is to implement 2 classes: one that (given the topology of the network) builds a routing table (neighbor discovering and Dijkstra), and another that extends class Message of the library and implements represent the messages exchanged by the routers. </p>
  
  <p>In particular, my doubts are:</p>
  
  <ul>
  <li>How can a router discover all its neighbors? </li>
  <li>What will be the structure of a message exchanged by routers?</li>
  </ul>
  
  <p>Thanks in advance.</p>