Frank Dellaert
|
e440767db9
|
Use [involves], and now updating orphan list
|
2009-11-20 05:23:47 +00:00 |
Michael Kaess
|
4ca1dbf325
|
generalized most of the update algorithm
|
2009-11-19 23:25:03 +00:00 |
|
Frank Dellaert
|
cd913566f2
|
I now use push_back to add factors to the new factor graph, and called getOrdering to compute a colamd order. I fixed the test so it checks the right order. Unfortunately colamd is a worse ordering, and the two cliques from before are merged into one.
|
2009-11-19 06:37:06 +00:00 |
|
Frank Dellaert
|
e2a3d1cb8f
|
Fixed test
|
2009-11-19 04:52:46 +00:00 |
|
Frank Dellaert
|
76d0a60b88
|
commented out all print statements
|
2009-11-18 18:22:08 +00:00 |
|
Michael Kaess
|
d0efe2da5e
|
update almost correct, except for order
|
2009-11-18 17:40:05 +00:00 |
|
Frank Dellaert
|
23031fbc04
|
convert clique into factor graph
|
2009-11-18 17:28:07 +00:00 |
|
Frank Dellaert
|
c7e76891da
|
skeleton hardcoded version
|
2009-11-18 17:03:19 +00:00 |
|
Frank Dellaert
|
bed219c997
|
no printout
|
2009-11-18 16:32:45 +00:00 |
|
Frank Dellaert
|
21974f95e1
|
test for incremental update
|
2009-11-18 16:31:19 +00:00 |
|
Frank Dellaert
|
ceed2ae17d
|
symbolic tree in testIncremental
|
2009-11-18 15:37:19 +00:00 |
|
Michael Kaess
|
f56bf8c79f
|
added missing include to satisfy stricter compiler; added isam test file
|
2009-11-17 21:47:42 +00:00 |