Timeline for Remove redundant dependencies from a directed acyclic graph
Current License: CC BY-SA 3.0
16 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:55 | history | edited | CommunityBot |
replaced http://mathematica.stackexchange.com/ with https://mathematica.stackexchange.com/
|
|
| Oct 8, 2013 at 11:15 | history | edited | Kuba | CC BY-SA 3.0 |
edited body
|
| Oct 8, 2013 at 11:04 | history | edited | Kuba | CC BY-SA 3.0 |
added 2 characters in body
|
| Oct 8, 2013 at 10:55 | history | edited | Kuba | CC BY-SA 3.0 |
improved formatting
|
| Oct 8, 2013 at 9:27 | history | edited | m_goldberg | CC BY-SA 3.0 |
added 2 characters in body
|
| Oct 8, 2013 at 9:23 | comment | added | Kuba |
@asterix314 I'm glad you find it useful. To make it even more compact you can write Implies @@@ list instead of list /. DirectedEdge->Implies. I used this because I'm not experienced with Graphs. So maybe better hold on with an accept to not discourage others in finding quicker way :)
|
|
| Oct 8, 2013 at 9:21 | comment | added | asterix314 | I was actually looking for graph-specific algorithms. This detour to the logic method is very refreshing indeed. But there must be a graph algorithm to it, too? | |
| Oct 8, 2013 at 9:13 | comment | added | asterix314 | Thanks Kuba for the clever idea of reformulating the problem using the language of logic. Along the same lines I got the following: reduce2[list_] := With[{impl = And @@ (list /. DirectedEdge -> Implies)}, List @@ BooleanMinimize[impl, "CNF"] /. {! a_ || b_ :> DirectedEdge[a, b], b_ || ! a_ :> DirectedEdge[a, b]}] | |
| Oct 8, 2013 at 9:11 | vote | accept | asterix314 | ||
| Oct 8, 2013 at 12:16 | |||||
| Oct 8, 2013 at 9:08 | comment | added | Kuba | @m_goldberg good idea, feel free to edit it whenever you want. | |
| Oct 8, 2013 at 9:03 | history | edited | m_goldberg | CC BY-SA 3.0 |
added 2 characters in body
|
| Oct 8, 2013 at 9:01 | comment | added | m_goldberg | I think it does work well. I had to do some testing with a couple of more interesting data sets to convince myself of it. Since I had the test notebook at hand, I thought why not post the tests as an illustration of the method? | |
| Oct 8, 2013 at 8:56 | history | edited | m_goldberg | CC BY-SA 3.0 |
Improved formatting of examples
|
| Oct 8, 2013 at 8:26 | history | edited | m_goldberg | CC BY-SA 3.0 |
Added two examples
|
| Oct 8, 2013 at 7:39 | history | edited | Kuba | CC BY-SA 3.0 |
edited body
|
| Oct 8, 2013 at 6:40 | history | answered | Kuba | CC BY-SA 3.0 |