PLEASE NOTE: this server,, will be unavailable on Monday 5th December, from 1pm until 4pm.
Web-based programs, such as csmarks, cssubmit, and the help fora, will all be unavailable.
  It's UWAweek 49


This forum is provided to promote discussion amongst students enrolled in CITS3001 Algorithms, Agents and Artificial Intelligence.

Please consider offering answers and suggestions to help other students! And if you fix a problem by following a suggestion here, it would be great if other interested students could see a short "Great, fixed it!"  followup message.

How do I ask a good question?
Displaying selected article
Showing 1 of 175 articles.
Currently 6 other people reading this forum.

 UWA week 34 (2nd semester, week 5) ↓
SVG not supported

Login to reply
4:16pm Wed 24th Aug, Ryan B.

You've stumbled upon a namespace conflict in CS (who would have thought??) The variables `n`, `p` are standard terminology in graph theory when we talk about constructing Random Graphs ( The `n` is referring to the number of vertices (or 'nodes`, take your pick), and `p` is the probability that an edge between 2 nodes occurs. There are lots of ways to generate random graphs, that lead to different results. I'd look into the Erdos-Renyi model to start with as a simple approach. Another piece of advice is there are often graph libraries in that will do the random generation for you... Hope this helps!

The University of Western Australia

Computer Science and Software Engineering

CRICOS Code: 00126G
Written by [email protected]
Powered by history
Feedback always welcome - it makes our software better!
Last modified  1:17AM Sep 14 2022
Privacy policy