STcount

Problem statement, definition, constraints, and public examples.

Problem Statement

Given a complete graph, find the number of spanning trees. A spanning tree of a graph is a set of edges that will ensure there is some path from any one vertex to another.

Definition

Class:: STcount
Method:: stCount
Parameters:: int
Returns:: long
Method signature:: long stCount(int size)
(be sure your method is public)

Constraints

size will be between 0 to 17.

Examples

No public sample cases were explicitly marked for this problem in the original data.

This problem statement is the exclusive and proprietary property of Topcoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of Topcoder, Inc. is strictly prohibited. (c)2024, Topcoder, Inc. All rights reserved.

Back to all problems