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

Clarification on Directed vs. Undirected SNN Graph in Seurat Clustering #9312

Open
tim-meese opened this issue Sep 13, 2024 · 0 comments
Open

Comments

@tim-meese
Copy link

Dear Seurat Developers,

I have a question regarding clustering in the Seurat package. From my understanding, Seurat performs clustering on the shared nearest neighbors (SNN) graph. Could you please clarify whether this graph is directed or undirected?

I intend to apply methods from the igraph package to the SNN graph and need to construct an igraph object. In the Seurat source code, I found the function RunLeiden(), which constructs an igraph object using graph_from_adjacency_matrix(adjmatrix = object, weighted = TRUE), resulting in a directed graph. However, I am unsure if the SNN graph itself is directed.

Thank you for your assistance.

Best regards,
Tim

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

No branches or pull requests

1 participant