Skip to content

akshaykamath/ConsistentSubDAG

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

10 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

ConsistentSubDAG

Algorithms mini project to find the consistent sub graphs in a given directed acyclic subgraphs.

This Program was built using Visual Studio 2015 Community Edition. Dot net version required is 4.5.2

To Specify the graph input, please modify "SubDags.exe.config" Set the "graphfilelocation" to the graph that needs to be tested. Set the "graphmode" to 1 if the input is an adjacency matrix Set the "graphmode" to 0 if the input is in the form of "child parent"

Test Message

About

Project to find find consistent sub graphs in a given Directed Acyclic Graph.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages