![]() |
AuD
Lecture 'Algorithmen und Datenstrukturen' (code examples)
|
Go to the source code of this file.
Classes | |
class | aud.example.graph.IterativeDFS2 |
iterative implementation of DFS Traversal like DepthFirstSearch but as for IterativeDFS1 the order of processed edges differs and nodes are marked before being pushed. More... | |
Packages | |
package | aud.example.graph |
demos of graph algorithms | |