10922
EXPLORE
LATEST
ABOUT
AUTHORING AREA
PARTICIPATE
Your browser does not support JavaScript or it may be disabled!
Connected Components
Some number of edges (with duplicates removed) are drawn at random between the
vertices in an
square. The Demonstration shows the connected components of the resulting graph.
Contributed by:
Ed Pegg
and
Daniel Lichtblau
Additional contributions by:
Jeff Bryant
THINGS TO TRY
Slider Zoom
SNAPSHOTS
RELATED LINKS
Connected Component
(
Wolfram
MathWorld
)
PERMANENT CITATION
"
Connected Components
" from
the Wolfram Demonstrations Project
http://demonstrations.wolfram.com/ConnectedComponents/
Contributed by:
Ed Pegg
and
Daniel Lichtblau
Additional contributions by:
Jeff Bryant
Share:
Embed Interactive Demonstration
New!
Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site.
More details »
Download Demonstration as CDF »
Download Author Code »
(preview »)
Files require
Wolfram
CDF Player
or
Mathematica
.
Related Demonstrations
More by Author
Nearest Neighbor Graph Connections
Jim Gerdy
Gauss Code Loops
Ed Pegg Jr
k-Cayley Trees
Filip Piekniewski
Find Bridging Edges in Networks
Phillip Bonacich
Finding Cliques in Networks
Phillip Bonacich
Boolean NK Networks
Garrett Neske
Random 3D Nearest Neighbor Networks
Yifan Hu and Stephen Wolfram
Random 2D Nearest Neighbor Networks
Yifan Hu and Stephen Wolfram
Networks for Basic Number Theoretic Functions
George Beck
Nearest Neighbor Networks
Yifan Hu and Stephen Wolfram
Related Topics
Discrete Mathematics
Graph Theory
Networks
High School Computer Science
High School Finite Mathematics
High School Mathematics
Browse all topics
Note: To run this Demonstration you need Mathematica 7+ or the free Mathematica Player 7EX
Download or upgrade to
Mathematica Player 7EX
I already have
Mathematica Player
or
Mathematica 7+