[jgrapht-users] Verifying That A Graph Is A Lattice

[Randall R S. <rs...@so...>]

Hi,

I'm a bit naive on the mathematics of lattices, so I'm not sure this 
question is well-formed, complete or sensible at all, so please bear 
with me.

I will be implementing an algorithm that operates, in part, on a graph 
structure, which I will probably represent using JGraphT. The 
algorithm's correctness depends on the graph being an "upper 
semilattice." Another related algorithm requires a "meet semilattice." 
Finally, a variation requires only a "lattice."

How might I go about verifying that the graph meets these requirements 
(any or all of them)? Is it something that would be facilitated by, or 
perhaps directly available in the JGraphT library?

I didn't see anything obvious in the JGraphT documentation that 
pertains, but that may again be a function of my ignorance.


Thanks in advance.


Randall Schulz