Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with combinatorica
Search options not deleted
user 46831
Combinatorica provided a large amount of functionality in fields such as graph theory and permutations.
6
votes
FindShortestPathTree superseded by FindSpanningTree?
Thanks for that. Impressive. An alternative that might be better reflected in the documentation is to use FindShortestPath.
(* FindShortestPath returns a procedure *)
With[{pathfunc=FindShortestPath[s …
- 663
6
votes
2
answers
216
views
FindShortestPathTree superseded by FindSpanningTree?
The on-line documentation for FindShortestPathTree (part of the Combinatorica package) says:
"ShortestPathSpanningTree has been superseded by FindSpanningTree"
I don't understand how to use FindSpanningTree …
- 663