Skip to content

Boolos/biconnected-components

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

49 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

biconnected-components

Experimentation with parallelizing algorithms related to biconnected components

####Each project is now in their separate directory. You can use the code in graph-generator directory to generate random graphs and write them out to a file. The supported flags are defined in the main.cpp file, but some of the more useful ones for you will be these:

  • -n nvertices -> the number of vertices in the graph
  • -m nedges -> the number of edges in the graph
  • -o file_path -> write the graph to a file
  • -d -> if specified, the graph will be a directed graph, otherwise by default it will be undirected.
  • -c -> if specified, the graph will be connected, otherwise by default there is no guarantee that it will be connected.
  • -k -> if specified, the graph will be a complete graph of size n (specified by the -n parameter) So if you want to specify an average degree per vertex, you would need to make sure the value of m/n is equal to the desired average degree.

About

Experimentation with parallelizing algorithms related to biconnected components

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Contributors 2

  •  
  •  

Languages