Here are the classes, structs, unions and interfaces with brief descriptions:
[detail level 12]
| ▼NMSA_di_unipi_it | The namespace MSA_di_unipi_it is defined to hold the MSArbor class |
| CMSArbor | Given a (complete) directed graph G = ( N , A ), with n = |N| nodes and m = |A| (= n ( n - 1 )) arcs, and arc costs C[ i , j ], the Minimal Spanning Arborescence problem (MSA) with root r requires to find a directed spanning tree (arborescence) of G rooted in r with minimal total cost, where the cost is the sum of the costs of the arcs belonging to the tree |
