#20186: Graph Connectivity Probability
--------------------------------+----------------------------
Reporter: jerudzin | Owner:
Type: enhancement | Status: needs_review
Priority: minor | Milestone: sage-7.1
Component: graph theory | Resolution:
Keywords: | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: | Stopgaps:
--------------------------------+----------------------------
Changes (by jerudzin):
* priority: major => minor
* component: PLEASE CHANGE => graph theory
* status: new => needs_review
* type: PLEASE CHANGE => enhancement
Old description:
New description:
This is a new function that computes the probability that vertices in a
simple undirected graph are connected.
The input is a (symmetric) probability matrix that assigns a probability
to each edge in the graph.
The output is a matrix containing the probability that each pair of
vertices will be connected in the graph given the edge probabilities in
the input matrix.
See the documentation in the file for more information.
--
--
Ticket URL: <http://trac.sagemath.org/ticket/20186#comment:1>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at https://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
