diff options
| author | JSDurand <mmemmew@gmail.com> | 2023-02-27 12:36:41 +0800 |
|---|---|---|
| committer | JSDurand <mmemmew@gmail.com> | 2023-02-27 12:36:41 +0800 |
| commit | fbaa420ed550e9c3e7cdc09d4a8ec22bfbd782a6 (patch) | |
| tree | fad9722825bb3fa796dd52c3fd4a8bf46b958cf9 /graph | |
| parent | afad02bdff111ecccb0077b9c989e869723c231c (diff) | |
before a major refactor
I decide to adopt a new approach of recording and updating item
derivation forests. Since this affects a lot of things, I decide to
commit before the refactor, so that I can create a branch for that
refactor.
Diffstat (limited to 'graph')
| -rw-r--r-- | graph/src/labelled/binary.rs | 4 |
1 files changed, 4 insertions, 0 deletions
diff --git a/graph/src/labelled/binary.rs b/graph/src/labelled/binary.rs index ce3a867..3b96b92 100644 --- a/graph/src/labelled/binary.rs +++ b/graph/src/labelled/binary.rs @@ -214,6 +214,10 @@ impl<T: GraphLabel> Graph for PLGraph<T> { let mut post = String::new(); + // FIXME: Find a way to print only used nodes. Maybe remove + // unwanted edges from unwanted nodes, so that we can print + // out only those used nodes. + for node in self.nodes() { post.push_str(&format!( " {node} [label = \"{}\"]\n", |