Typical applications involve processing graphs defined in files or on web pages, using strings, not integer indices, to define and refer to vertices. To accommodate such applications, we define an input format with the following properties: - Vertex names are strings. - A specified delimiter separates vertex names (to allow for the possibility of spaces in names). - Each line represents a set of e
| 37 | /// ... |
| 38 | /// |
| 39 | pub struct SymbolGraph<'a> { |
| 40 | st: HashMap<&'a str, usize>, |
| 41 | keys: Vec<&'a str>, |
| 42 | graph: Box<dyn IGraph>, |
| 43 | } |
| 44 | |
| 45 | impl<'a> SymbolGraph<'a> { |
| 46 | /// is key a vertex? |
nothing calls this directly
no outgoing calls
no test coverage detected