Hi,
I will refer to graph shown in this example:
https://github.com/introlab/rtabmap/wiki/Cplusplus-Loop-Closure-Detection1. It is the weight of the node, increased by rehearsal approach of rtabmap (when consecutive locations are similar, they are merged together).
2. Rehearsed nodes point to their parent, but parent won't point to their rehearsed nodes. The rehearsed nodes are not used anymore in the map. All other links would go in both direction.
3. M means Merged (rehearsed nodes as explained above). L means loop closure (parent), C means child of a loop closure. For example, if location 99 loops on location 12, there will be a link L from 99 to 12, and a link C from 12 to 99. Other links without label are neighbor links or odometry links (bidiectional).
4. "a number is highlighted ..." not sure to see this. Can you add a screenshot?
5. See this comment:
https://github.com/introlab/rtabmap/issues/497#issuecomment-5826583276. Open the Graph View tab, it will show your changes directly without having to close/reopen the database. When a new constraint is added or removed, the graph is automatically re-optimized.
cheers,
Mathieu