networks(deprecated)/djspantree - Help

Online Help

All Products    Maple    MapleSim


Home : Support : Online Help : networks(deprecated)/djspantree

networks[djspantree] - edge-disjoint spanning trees of a graph

Calling Sequence

djspantree(G)

Parameters

G

-

graph or network

Description

• 

Important: The networks package has been deprecated.  Use the superseding package GraphTheory instead.

• 

This routine uses Edmonds's matroid partitioning algorithm to find a partition of G into the minimum number of forests. This partitioning works in such a way that as many as possible of the forests in the final partition are spanning trees.

• 

The actual result is returned as a table of edge sets which can be used to induce the appropriate subgraphs.

• 

This routine is normally loaded via the command with(networks) but may also be referenced using the full name networks[djspantree](...).

Examples

Important: The networks package has been deprecated.  Use the superseding package GraphTheory instead.

withnetworks:

G:=complete3,4:

addedge1,5,G:

djspantreeG

table1=e10,e11,e12,e13,e5,e7,2=e1,e2,e3,e4,e6,e9,3=e8,4=,5=,6=,7=

(1)

ends1,G

1,5,2,4,2,6,3,5,3,6,3,7

(2)

See Also

GraphTheory, networks(deprecated)[components], networks(deprecated)[countcuts], with


Download Help Document

Was this information helpful?



Please add your Comment (Optional)
E-mail Address (Optional)
What is ? This question helps us to combat spam