rewrite rrgraphview brief

Author: treelin611

libs/librrgraph/src/base/rr_graph_builder.h

@@ -38,7 +38,7 @@ class RRGraphBuilder {
     t_rr_graph_storage& rr_nodes();
     /** @brief Return a writable object for update the fast look-up of rr_node */
     RRSpatialLookup& node_lookup();
-    /** @warning The Metadata should stay as an independent data structure than rest of the internal data,
+    /** @warning The Metadata should stay as an independent data structure from the rest of the internal data,
      *  e.g., node_lookup! */
     /** @brief Return a writable object for the meta data on the nodes */
     MetadataStorage<int>& rr_node_metadata();
@@ -396,7 +396,7 @@ class RRGraphBuilder {
     /* Detailed information about the switches, which are used in the RRGraph */
     vtr::vector<RRSwitchId, t_rr_switch_inf> rr_switch_inf_;
 
-    /** @warning The Metadata should stay as an independent data structure than rest of the internal data,
+    /** @warning The Metadata should stay as an independent data structure from the rest of the internal data,
      *  e.g., node_lookup! */
     /* Metadata is an extra data on rr-nodes and edges, respectively, that is not used by vpr
      * but simply passed through the flow so that it can be used by downstream tools.

libs/librrgraph/src/base/rr_graph_view.h

@@ -3,20 +3,28 @@
 
 /**
  * @file
- * @brief The RRGraphView encapsulates a read-only routing resource graph, providing clients with tailored frame views of the object. 
+ * @brief The RRGraphView class provides a read-only interface to access the RRGraph.
  * 
- * The RRGraphView represents the full frame view of the routing resource graph, offering several advantages:
- * - Reduces the memory footprint for each client.
- * - Minimizes the need for extensive API changes, as each frame view delivers ad-hoc APIs suited to the specific needs of individual clients.
+ * The RRGraphView class offers tools like routing algorithms, graphics, and statistical analysis 
+ * a read-only interface to the underlying RRGraph, which models the programmable routing fabric 
+ * of the FPGA. The fundamental data structure of the RRGraph is a graph consisting of nodes 
+ * (representing routing resources) and outgoing edges (representing connections between routing resources). 
  * 
+ * Each node and edge is enhanced with additional metadata, such as the location of the node within 
+ * the chip and electrical parameters, to make algorithms more efficient, aid in drawing the chip, 
+ * and estimate signal delays. RRGraphView ensures that tools can access this data safely without 
+ * modifying the underlying structure.
+ * 
+ * 
+ * \internal
  * A unified object that includes pointers to:
  * - Node storage
- * \internal
  * - TODO: Edge storage
  * - TODO: Node PTC storage
  * - TODO: Node fan-in storage
- * \endinternal
  * - RR node indices
+ * \endinternal
+
  *
  * @note The RRGraphView does not own the storage. It provides a virtual 
  * read-only protocol for: