Skip to content

jfactor7/StronglyConnectedGraphs

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

9 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

PA4 by Jerico Factor 

List.h
	Declare functions for List Object

List.c
	Define functions for List Object

Digraph.h
	Declare functions for Digraph Object

Digraph.c
	Define functions for Digraph Object

DiagraphProperties.c
	read an input, create graph, do commands from inputfile, writes to outputfile

Digraph Struct
	int [] visitStatus   //used to keep track of visited status for dfs and bfs 
	List [] outEdge      //contains the outgoing edges for each vertex
	List [] inEdge       //contains the incoming edges for each vertex.
	int [] distance      //contains distance relative to a certain vertex, not needed for pa4 
	int numSCC           //contains the number of SCC in graph
	int [] SCC           //contains which SCC vertex is in
	int graphChanged     //if graph has changed since checking for SCC

About

Finding strongly connected components in graphs

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published