This software runs through a directional graph and writes the paths it found as test specifications.
It has a simple algorithm (DFS with modifications) and allows sorting children before traversing.
It can traverse through graphs provided as EPC, UML or Adjacency Table.
Rate This ProjectLogin To Rate This Project
Be the first to post a review of zBifurcumInPython!