Skip to content
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

More on release 2.7.0 #166

Merged
merged 12 commits into from
Feb 4, 2025
Merged

More on release 2.7.0 #166

merged 12 commits into from
Feb 4, 2025

Conversation

tomhanika
Copy link
Owner

No description provided.

tomhanika and others added 12 commits September 4, 2024 11:24
* Adapted workflow for update-deps-lock.yaml when release

If release tag is pushed, the script failed. The reason is, that the head is not a branch head anymore.

* Add files via upload

* Rename CITATION (21).cff to CITATION.cff

* fixed email

---------

Co-authored-by: Tom Hanika <[email protected]>
Co-authored-by: Anna Schwerdtel <[email protected]>
Corrected (Main) Authors.
* Implemented breadth-first-search.

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.

* New functionality: Compute the connected components of an undirected graph.

* Implemented k-cores

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.

* Created tests for k-cores

* Implemented k-cores for contexts

* Implemented tests for k-cores for contexts

Implemented tests for the k-cores-functions of context-to-graph-projections.

* Small cosmetics

* Added average-shortest-path-via-bfs

Added the functionality to compute the average shortest path length of a graph or context via breadth-first search.

* Created tests for avg-shortest-path-via-bfs

* Added functionality to compute clustering coefficients for graphs

Conflicts:
	src/main/clojure/conexp/fca/applications/socialanalytics.clj

* Created tests for clustering coefficients

Conflicts:
	src/test/clojure/conexp/fca/applications/socialanalytics_test.clj

* Implemented clustering-coefficient for bipartite graphs

* Created tests for two-mode clustering

Conflicts:
	src/test/clojure/conexp/fca/applications/socialanalytics_test.clj

* Implemented betweenes-centrality

* Implemented function ``close?`` to compare doubles

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.

* Added tests for betweenes-centrality

* Added betweenes-centrality for contexts

* Implemented tests for betweenes-centrality for contexts

* Small cosmetics in tests

* Restructuring

I moved all stuff concerning basic graph structuring, such as breadth-first search or computing graphs from contexts into a seperated file ``structure``.

* Overwrite of adjacency-matrices and average-shortest-path

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.

* Added needed dependencies

* Restructured average-shortest-path

* Formatting

* Updated Contribution

* close? -> near?

---------

Co-authored-by: Maximilian Stubbemann <[email protected]>
Co-authored-by: Maximilian Stubbemann <[email protected]>
Co-authored-by: Tom Hanika <[email protected]>
* Implemented Method for Accessing Contexts from FCATools Repository.

* Removed Previously Downloaded Contexts.

* Added Documentation.

* Minor Formatting Correction

* Minor Formatting Correction

* Minor Grammar Correction
* Added Documentation for Standalone Client.

* Updated Link and Names for Standalone Client.

* Updated Link in README

* Update README.md

Updated link

* Update Getting-Started.org

updated name for brunt

---------

Co-authored-by: Tom Hanika <[email protected]>
@tomhanika tomhanika merged commit 1e2d3b2 into master Feb 4, 2025
2 checks passed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

4 participants