-
Notifications
You must be signed in to change notification settings - Fork 1
initial commit #3
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
base: main
Are you sure you want to change the base?
Conversation
| String userChoice = s.nextLine().trim().toLowerCase(); | ||
| boolean labelled = userChoice.equals("yes"); | ||
|
|
||
|
|
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
got an extra line here
| patternGraph, | ||
| patternGraphFilepath); | ||
| AlgorithmRunner.runAlgorithm(result, hostGraph, patternGraph); | ||
| AlgorithmRunner.runAlgorithm(result, hostGraph, patternGraph,labelled); |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
| AlgorithmRunner.runAlgorithm(result, hostGraph, patternGraph,labelled); | |
| AlgorithmRunner.runAlgorithm(result, hostGraph, patternGraph, labelled); |
|
@Vinay00018 sorry for the delay on my end, this is a very nice first commit, you absolutely have the right idea |
| public static void runAlgorithm(RunResult result, Graph hostGraph, Graph patternGraph,boolean labelled) { | ||
| if (labelled) { | ||
| // If labelled, run the labelled subgraph counting algorithm | ||
| LabelledSubgraphCountingAlgorithm lSa = new LabelledSubgraphCountingAlgorithm(hostGraph, patternGraph, hostGraph.getHighestDegVertices(0)); |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
we still want to use the ParameterValueOptimiser to work out which vertices should be the high-degree vertices (see lines 44-49 below)
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
It would also be useful to update RunResult so that we can say whether we counted labelled or unlabelled copies (could actually include both, since when we've counted unlabelled copies, we also know how many labelled copies there are)
| int A = labelledSubgraphCountingAlgorithm.run(); | ||
|
|
||
|
|
||
| int B = BruteForceLabelledSubgraphCountingAlgorithm.countLabelledCopiesWithLists(patternGraph,hostGraph); |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
some more descriptive variable names would be helpful
I did small changes