Naive (All Maximal Non-Branching Paths in a Graph All Maximal Non-Branching Paths in a Graph): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

10 April 2023

15 February 2023

  • curprev 11:5311:53, 15 February 2023‎ Admin talk contribs‎ 453 bytes +453‎ Created page with "== Time Complexity == $O(m)$ == Space Complexity == $O(n)$ auxiliary? words (For each vertex, store whether that vertex is a 1-in-1-out vertex (all of these can be pre-computed at the same time in $O(m)$ time). Unclear if there's a better bound) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1940 == Reference == http://rosalind.info/problems/ba3m/"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Naive_(All_Maximal_Non-Branching_Paths_in_a_Graph_All_Maximal_Non-Branching_Paths_in_a_Graph)"