Opened 17 years ago
Closed 17 years ago
#267 closed task (fixed)
Revise the interface of MinCostArborescence
| Reported by: | Peter Kovacs | Owned by: | Peter Kovacs |
|---|---|---|---|
| Priority: | major | Milestone: | LEMON 1.1 release |
| Component: | core | Version: | hg main |
| Keywords: | Cc: | ||
| Revision id: |
Description
- Check the interface (and the documentaton).
- Rename
DefXyztemplate named pramaters toSetXyz.
Attachments (2)
Change History (8)
Changed 17 years ago by
| Attachment: | 61676b3b85f0.patch added |
|---|
comment:1 follow-ups: 3 4 Changed 17 years ago by
comment:2 Changed 17 years ago by
| Status: | new → assigned |
|---|
comment:3 Changed 17 years ago by
Replying to kpeter:
The attached patch [61676b3b85f0] contains improvements and fixes. It renames DefXyz template named pramaters to SetXyz and also extends the test file with interface checking.
I suggest another renaming:
arborescenceValue()-->arborescenceCost(), like in matching algorithmsmatchingValue()was renamed tomatchingWeight().As far as I understand, this algorithm is practically the Prim algorithm for directed graphs. Am I right?
I don't think so. There are some vague similarities but the differences are much more substantial.
comment:4 Changed 17 years ago by
Replying to kpeter:
I suggest another renaming:
arborescenceValue()-->arborescenceCost(), like in matching algorithmsmatchingValue()was renamed tomatchingWeight().
Let's do it!
Changed 17 years ago by
| Attachment: | 029a48052c67.patch added |
|---|
comment:5 Changed 17 years ago by
[029a48052c67] is the same as [61676b3b85f0], with the addition of the arborescenceValue() --> arborescenceCost() renaming.
comment:6 Changed 17 years ago by
| Resolution: | → fixed |
|---|---|
| Status: | assigned → closed |
[029a48052c67] went to the main branch.
The attached patch [61676b3b85f0] contains improvements and fixes. It renames DefXyz template named pramaters to SetXyz and also extends the test file with interface checking.
I suggest another renaming:
arborescenceValue()-->arborescenceCost(), like in matching algorithmsmatchingValue()was renamed tomatchingWeight().As far as I understand, this algorithm is practically the Prim algorithm for directed graphs. Am I right? If yes, then it should be noted in the doc.