I have just started using Gephi to visualise a schema of keywords that I am creating to catalogue items in a database. I have created a network in which the keywords (nodes) are connected by directional edges that indicate which words 'belong to' others.
For example, a group of keywords might be related as follows:
I have managed to visualise the network with good results. Now, what I want to do is to identify all of the 'downstream' words associated with any word that I choose. So, if I select 'poodle', I want Gephi to identify 'dog', 'mammal', and 'animal' (assuming that 'animal' has no further targets). Or to put it another way, I want to recursively identify all of the target nodes flowing from the node that I select.
I am new to networks, but this strikes me as something that should be very easy to do. Is there a way that I can do it by using Gephi? The ego network filter comes close, but it doesn't discriminate between incoming and outgoing connections. Perhaps I can add a sub-filter to select just the outgoing connections?
If there is another simple way to do this (e.g. with a database query on the exported Gephi data) then I'll happily try that as well. My end goal is to create a 'lookup table' for every keyword so that I can consistently enter all of the parent keywords when cataloging new items.