git-svn-id: file:///home/git/hedgehog.fhcrc.org/bioconductor/trunk/madman/Rpacks/RBGL@8634 bc3139a8-67e5-0310-9ffc-ced21a209358
Vince Carey authored on 13/05/2004 20:32:24
git-svn-id: file:///home/git/hedgehog.fhcrc.org/bioconductor/trunk/madman/Rpacks/RBGL@6017 bc3139a8-67e5-0310-9ffc-ced21a209358
Vince Carey authored on 09/10/2003 04:44:05
| ... | ... |
@@ -1,3 +1,12 @@ |
| 1 |
+Plan of Oct 2003 |
|
| 2 |
+---------------- |
|
| 3 |
+1) rationalize graph and BGL approaches to undirected |
|
| 4 |
+graphs -- graph wants reciprocated directed edges, BGL |
|
| 5 |
+does not |
|
| 6 |
+2) implement interfaces for |
|
| 7 |
+ a) connected components |
|
| 8 |
+ b) maximum flow/minimum disconnecting set |
|
| 9 |
+ |
|
| 1 | 10 |
Plan of July 2003 |
| 2 | 11 |
1) state basic constraints: |
| 3 | 12 |
a) all edge weights will be coerced to double on way in |
git-svn-id: file:///home/git/hedgehog.fhcrc.org/bioconductor/trunk/madman/Rpacks/RBGL@5134 bc3139a8-67e5-0310-9ffc-ced21a209358
Vince Carey authored on 14/07/2003 01:23:45
| ... | ... |
@@ -1,3 +1,10 @@ |
| 1 |
+Plan of July 2003 |
|
| 2 |
+1) state basic constraints: |
|
| 3 |
+ a) all edge weights will be coerced to double on way in |
|
| 4 |
+ b) separate C++ functions need to be written for directed |
|
| 5 |
+ and undirected inputs |
|
| 6 |
+2) simplify the C++ source of the R interfaces |
|
| 7 |
+ |
|
| 1 | 8 |
Plan of April 2003 |
| 2 | 9 |
|
| 3 | 10 |
1) Use Boost 1.30.0 and make sure library |
git-svn-id: file:///home/git/hedgehog.fhcrc.org/bioconductor/trunk/madman/Rpacks/RBGL@3862 bc3139a8-67e5-0310-9ffc-ced21a209358
Vince Carey authored on 02/04/2003 16:38:30
| ... | ... |
@@ -2,6 +2,7 @@ Plan of April 2003 |
| 2 | 2 |
|
| 3 | 3 |
1) Use Boost 1.30.0 and make sure library |
| 4 | 4 |
still works for tsort and DAG cycle check |
| 5 |
+*DONE 2 April |
|
| 5 | 6 |
|
| 6 | 7 |
2) convert tsort application to .Call interface |
| 7 | 8 |
|
| ... | ... |
@@ -10,6 +11,7 @@ to Boost graphs, and bring in a graph with weights |
| 10 | 11 |
or distances |
| 11 | 12 |
|
| 12 | 13 |
4) deploy their MST method and compare to R mstree |
| 14 |
+*KMST is in 2 april |
|
| 13 | 15 |
|
| 14 | 16 |
5) list the applications we want to have and try |
| 15 | 17 |
to get a generic interface |
git-svn-id: file:///home/git/hedgehog.fhcrc.org/bioconductor/trunk/madman/Rpacks/RBGL@3809 bc3139a8-67e5-0310-9ffc-ced21a209358
Vince Carey authored on 01/04/2003 12:45:02
| 1 | 1 |
new file mode 100644 |
| ... | ... |
@@ -0,0 +1,20 @@ |
| 1 |
+Plan of April 2003 |
|
| 2 |
+ |
|
| 3 |
+1) Use Boost 1.30.0 and make sure library |
|
| 4 |
+still works for tsort and DAG cycle check |
|
| 5 |
+ |
|
| 6 |
+2) convert tsort application to .Call interface |
|
| 7 |
+ |
|
| 8 |
+3) get a better grip on how R data can be converted |
|
| 9 |
+to Boost graphs, and bring in a graph with weights |
|
| 10 |
+or distances |
|
| 11 |
+ |
|
| 12 |
+4) deploy their MST method and compare to R mstree |
|
| 13 |
+ |
|
| 14 |
+5) list the applications we want to have and try |
|
| 15 |
+to get a generic interface |
|
| 16 |
+ |
|
| 17 |
+6) consider building boost graphs in R by |
|
| 18 |
+manipulating pointer structures. perhaps this |
|
| 19 |
+should be the highest priority! boostGraph |
|
| 20 |
+as a descendant of graph |