DFS (B2R2) | B2R2

DFS Module

Namespace: B2R2.MiddleEnd.BinGraph.Traversal
Assembly: B2R2.MiddleEnd.BinGraph.dll

Provides depth-first traversal functions.

Functions and values

Function or value	Description
`foldPostorder g fn acc` Full Usage: `foldPostorder g fn acc` Parameters: g : `IDiGraphAccessible<'a, 'b>` fn : `'c -> IVertex<'a> -> 'c` acc : `'c` Returns: `'c` Type parameters: 'a, 'b, 'c (requires equality and equality)	Folds vertices of the graph in a depth-first manner with the postorder traversal. This function visits every vertex in the graph including unreachable ones. For those unreachable vertices, the order is random. g : `IDiGraphAccessible<'a, 'b>` fn : `'c -> IVertex<'a> -> 'c` acc : `'c` Returns: `'c`
`foldPostorderWithRoots g roots fn acc` Full Usage: `foldPostorderWithRoots g roots fn acc` Parameters: g : `IDiGraphAccessible<'a, 'b>` roots : `IVertex<'a> seq` fn : `'c -> IVertex<'a> -> 'c` acc : `'c` Returns: `'c` Type parameters: 'a, 'b, 'c (requires equality and equality)	Folds vertices of the graph in a depth-first manner with the postorder traversal, starting from the given root vertices. g : `IDiGraphAccessible<'a, 'b>` roots : `IVertex<'a> seq` fn : `'c -> IVertex<'a> -> 'c` acc : `'c` Returns: `'c`
`foldPreorder g fn acc` Full Usage: `foldPreorder g fn acc` Parameters: g : `IDiGraphAccessible<'a, 'b>` fn : `'c -> IVertex<'a> -> 'c` acc : `'c` Returns: `'c` Type parameters: 'a, 'b, 'c (requires equality and equality)	Folds vertices of the graph in a depth-first manner with the preorder traversal. This function visits every vertex in the graph including unreachable ones. For those unreachable vertices, the order is random. g : `IDiGraphAccessible<'a, 'b>` fn : `'c -> IVertex<'a> -> 'c` acc : `'c` Returns: `'c`
`foldPreorderWithRoots g roots fn acc` Full Usage: `foldPreorderWithRoots g roots fn acc` Parameters: g : `IDiGraphAccessible<'a, 'b>` roots : `IVertex<'a> list` fn : `'c -> IVertex<'a> -> 'c` acc : `'c` Returns: `'c` Type parameters: 'a, 'b, 'c (requires equality and equality)	Folds vertices of the graph in a depth-first manner with the preorder traversal, starting from the given root vertices. g : `IDiGraphAccessible<'a, 'b>` roots : `IVertex<'a> list` fn : `'c -> IVertex<'a> -> 'c` acc : `'c` Returns: `'c`
`foldRevPostorder g fn acc` Full Usage: `foldRevPostorder g fn acc` Parameters: g : `IDiGraphAccessible<'a, 'b>` fn : `'c -> IVertex<'a> -> 'c` acc : `'c` Returns: `'c` Type parameters: 'a, 'b, 'c (requires equality and equality)	Folds vertices of the graph in a depth-first manner with the reverse postorder traversal. This function visits every vertex in the graph including unreachable ones. For those unreachable vertices, the order is random. g : `IDiGraphAccessible<'a, 'b>` fn : `'c -> IVertex<'a> -> 'c` acc : `'c` Returns: `'c`
`foldRevPostorderWithRoots g roots fn acc` Full Usage: `foldRevPostorderWithRoots g roots fn acc` Parameters: g : `IDiGraphAccessible<'a, 'b>` roots : `IVertex<'a> seq` fn : `'c -> IVertex<'a> -> 'c` acc : `'c` Returns: `'c` Type parameters: 'a, 'b, 'c (requires equality and equality)	Folds vertices of the graph in a depth-first manner with the reverse postorder traversal, starting from the given root vertices. g : `IDiGraphAccessible<'a, 'b>` roots : `IVertex<'a> seq` fn : `'c -> IVertex<'a> -> 'c` acc : `'c` Returns: `'c`
`iterPostorder g fn` Full Usage: `iterPostorder g fn` Parameters: g : `IDiGraphAccessible<'a, 'b>` fn : `IVertex<'a> -> unit` Type parameters: 'a, 'b (requires equality and equality)	Iterates vertices of the graph in a depth-first manner with the postorder traversal. This function visits every vertex in the graph including unreachable ones. For those unreachable vertices, the order is random. g : `IDiGraphAccessible<'a, 'b>` fn : `IVertex<'a> -> unit`
`iterPostorderWithRoots g roots fn` Full Usage: `iterPostorderWithRoots g roots fn` Parameters: g : `IDiGraphAccessible<'a, 'b>` roots : `IVertex<'a> seq` fn : `IVertex<'a> -> unit` Type parameters: 'a, 'b (requires equality and equality)	Iterates vertices of the graph in a depth-first manner with the postorder traversal, starting from the given root vertices. g : `IDiGraphAccessible<'a, 'b>` roots : `IVertex<'a> seq` fn : `IVertex<'a> -> unit`
`iterPreorder g fn` Full Usage: `iterPreorder g fn` Parameters: g : `IDiGraphAccessible<'a, 'b>` fn : `IVertex<'a> -> unit` Type parameters: 'a, 'b (requires equality and equality)	Iterates vertices of the graph in a depth-first manner with the preorder traversal. This function visits every vertex in the graph including unreachable ones. For those unreachable vertices, the order is random. g : `IDiGraphAccessible<'a, 'b>` fn : `IVertex<'a> -> unit`
`iterPreorderWithRoots g roots fn` Full Usage: `iterPreorderWithRoots g roots fn` Parameters: g : `IDiGraphAccessible<'a, 'b>` roots : `IVertex<'a> list` fn : `IVertex<'a> -> unit` Type parameters: 'a, 'b (requires equality and equality)	Iterates vertices of the graph in a depth-first manner with the preorder traversal, starting from the given root vertices. g : `IDiGraphAccessible<'a, 'b>` roots : `IVertex<'a> list` fn : `IVertex<'a> -> unit`
`iterRevPostorder g fn` Full Usage: `iterRevPostorder g fn` Parameters: g : `IDiGraphAccessible<'a, 'b>` fn : `IVertex<'a> -> unit` Type parameters: 'a, 'b (requires equality and equality)	Iterates vertices of the graph in a depth-first manner with the reverse postorder traversal. This function visits every vertex in the graph including unreachable ones. For those unreachable vertices, the order is random. g : `IDiGraphAccessible<'a, 'b>` fn : `IVertex<'a> -> unit`
`iterRevPostorderWithRoots g roots fn` Full Usage: `iterRevPostorderWithRoots g roots fn` Parameters: g : `IDiGraphAccessible<'a, 'b>` roots : `IVertex<'a> seq` fn : `IVertex<'a> -> unit` Type parameters: 'a, 'b (requires equality and equality)	Iterates vertices of the graph in a depth-first manner with the reverse postorder traversal, starting from the given root vertices. g : `IDiGraphAccessible<'a, 'b>` roots : `IVertex<'a> seq` fn : `IVertex<'a> -> unit`