remove all nodes with only one connection

[naught101]

It would be nice if there was a way to simplify a graph by removing all nodes with only one connection. This would allow you to build a complex, meaningful network fairly quickly (explore a few things, find some connections, then delete the guff).

It would also be nice to be able to manually delete selected nodes somehow.

[controversial]

I like the idea of a function to “delete selected nodes.” Right now Wikipedia Map isn’t under active development; I’m working on it only on more of a maintenance level, but I’ll keep this in mind for the future.

On Tue, Dec 31, 2019 at 12:36 AM naught101 [email protected] wrote:

It would be nice if there was a way to simplify a graph by removing all nodes with only one connection. This would allow you to build a complex, meaningful network fairly quickly (explore a few things, find some connections, then delete the guff).

It would also be nice to be able to manually delete selected nodes somehow.

— You are receiving this because you are subscribed to this thread. Reply to this email directly, view it on GitHub https://github.com/controversial/wikipedia-map/issues/42?email_source=notifications&email_token=ACPFRLZ3TDWTJPQUMFZINGLQ3LK45A5CNFSM4KBSXRPKYY3PNVWWK3TUL52HS4DFUVEXG43VMWVGG33NNVSW45C7NFSM4IDOHCFA, or unsubscribe https://github.com/notifications/unsubscribe-auth/ACPFRL7SSASQXQF7WQE74Y3Q3LK45ANCNFSM4KBSXRPA .