Represent character path compactly

Reduces space used to represent paths by half.

save/src/protos.proto

@@ -9,7 +9,7 @@ message Meta {
 
 message Character {
     // Graph edges to traverse from the origin to find the node containing the character's entity
-    repeated uint32 path = 1;
+    bytes path = 1;
 }
 
 message EntityNode {

save/src/protos.rs

@@ -10,8 +10,8 @@ pub struct Meta {
 #[derive(Clone, PartialEq, ::prost::Message)]
 pub struct Character {
     /// Graph edges to traverse from the origin to find the node containing the character's entity
-    #[prost(uint32, repeated, tag = "1")]
-    pub path: ::prost::alloc::vec::Vec<u32>,
+    #[prost(bytes = "vec", tag = "1")]
+    pub path: ::prost::alloc::vec::Vec<u8>,
 }
 #[allow(clippy::derive_partial_eq_without_eq)]
 #[derive(Clone, PartialEq, ::prost::Message)]

server/src/sim.rs

@@ -77,10 +77,10 @@ impl Sim {
     }
 
     pub fn save(&mut self, save: &mut save::Save) -> Result<(), save::DbError> {
-        fn path_from_origin(graph: &Graph, mut node: NodeId) -> Vec<u32> {
+        fn path_from_origin(graph: &Graph, mut node: NodeId) -> Vec<u8> {
             let mut result = Vec::new();
             while let Some(parent) = graph.parent(node) {
-                result.push(parent as u32);
+                result.push(parent as u8);
                 node = graph.neighbor(node, parent).unwrap();
             }
             result.reverse();