Timeline for Path Compression Algorithm in C#
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 3 at 1:02 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Mar 4 at 0:25 | answer | added | Henners2002 | timeline score: 2 | |
| Feb 19 at 18:00 | comment | added | Shahar Shokrani | @PeterCsala Nice lead, I'll check it | |
| Feb 19 at 16:09 | comment | added | Peter Csala | Is there any particular reason why do implement your own graph representation and traversal? Have you checked QuickGraph or its fork QuikGraph? | |
| Feb 18 at 20:32 | comment | added | Shahar Shokrani | @DasKrümelmonster thank you, this is what I did eventually | |
| Feb 18 at 12:04 | comment | added | DasKrümelmonster | As your aim is the removal of nodes, it might be worthwhile to transform your edge list into a node list first (with links). Then you can go through your node list once and remove any invisible ones. When you remove a node, you can add all of the successors to each of the predecessors and then consider it removed. | |
| Feb 18 at 11:16 | history | edited | Shahar Shokrani | CC BY-SA 4.0 |
deleted 64 characters in body
|
| Feb 18 at 10:55 | history | edited | Shahar Shokrani | CC BY-SA 4.0 |
deleted 21 characters in body
|
| Feb 18 at 10:27 | history | asked | Shahar Shokrani | CC BY-SA 4.0 |