SNA #29
Open
SNA #29
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
I implemented a function to compute all reachable nodes from a starting node via breadth-first-search. As it may be useful to also have the distances to the starting node (computing average-shortest-paths for example!) The new function returns a map with reachable nodes as keys and the distances to the starting point as values.
The new functionality allows to compute the k-cores of a given graph. The k-cores of a graph g are the connected components of the maximal subgraph in which each node has at least k neighbours.
Implemented tests for the k-cores-functions of context-to-graph-projections.
Added the functionality to compute the average shortest path length of a graph or context via breadth-first search.
Conflicts: src/main/clojure/conexp/fca/applications/socialanalytics.clj
Conflicts: src/test/clojure/conexp/fca/applications/socialanalytics_test.clj
Conflicts: src/test/clojure/conexp/fca/applications/socialanalytics_test.clj
If functions which operate with doubles are tested, it is possible that rounding errors occur and tests like (is (= a b)) will fail. For this reason I implemented a function ``close?`` that takes arguments x,y and epsilon and checks if |x-y| <= epsilon.
I moved all stuff concerning basic graph structuring, such as breadth-first search or computing graphs from contexts into a seperated file ``structure``.
The new version stores the whole adjacency-matrix and works also for directed graphs. Using the whole matrix and not just the upper triangle makes the code much smaller but slows down the computation with factor 2 as a drawback.
Closed
tomhanika
requested changes
Feb 9, 2020
src/main/clojure/conexp/base.clj
Outdated
| @@ -117,6 +117,21 @@ metadata (as provided by def) merged into the metadata of the original." | |||
| (clojure.test/is true)))) | |||
| body))) | |||
|
|
|||
| (defn close? | |||
There was a problem hiding this comment.
The name 'close' might be ill chosen. Since we deal with a lot of clos(ures/ed) sets one might choose 'near' here maybe?
| @@ -12,6 +12,14 @@ | |||
|
|
|||
| ;;; | |||
|
|
|||
| (deftest test-close? | |||
|
Done=) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Hey Tom,
this PR contains social analytics stuff that would probably be useful for SNA courses.
It includes:
-Average Shortest Path
I also did some restructuring of the social analytics functionality that was already merged into dev by an earlier PR:
General graph functionality (transforming contexts to graphs or adjacency maps etc.) and social analytics measures are now separated into two different files.
Regards,
Max