|
eRqlEngine API documentation - http://www.wleklinski.de/rdf/ | ||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectgr.forth.ics.vrp.corevrp.model.RDF_DAG
RDF_DAG.java - DAG stands for Directed Acyclic Graph. This class has been generated to describe the Directed Acyclic Graph for classes and properties in respect to the subClass and subProperty relations. It consists of a HashMap containing the Objects as key and the corresponding sub resources are in a HashSet as the value. The graph might consist of several parts that are not connected. To enable an easy traversal the roots are stored in a seperate ArrayList.
Field Summary | |
HashMap |
dag
Containing the elements of the adjazenz list. |
Constructor Summary | |
RDF_DAG()
Create a new RDF_DAG. |
Method Summary | |
void |
enter(Object sub,
Object super_res,
boolean resource)
|
void |
enter(Resource s)
|
void |
enter(Resource sub,
Resource super_res)
|
void |
enter(String s)
|
void |
enter(String sub,
String super_res)
|
void |
enumerate()
Print the DAG-Graph to Std IO. |
HashSet |
findRoots()
Recompute the roots, i.e., the nodes without ancestors based on the information |
void |
getAllAncestors()
Computes the distinct ancestors for all nodes contained in the dag and put the number of the descendants in the dag |
void |
getAllDescendants(Resource res)
Computes the distinct descendants for all nodes under the |
HashMap |
getdag()
|
HashSet |
getLeaves()
Find the leaves, i.e., the nodes without descendants based on the information |
ArrayList |
getloop_element()
|
boolean |
getno_loop()
|
ArrayList |
getorder()
Accessing the order. |
HashSet |
getRelatives(Resource res,
int i)
Returns a HashSet containing all the distinct relatives of a node res |
HashSet |
getroots()
|
boolean |
loopcheck()
Checking the graph for loops and creating the topological order list. |
String |
output()
Return a string containing the topological order of the DAG. |
boolean |
remove(Object sub,
Object super_res,
boolean resource)
|
boolean |
remove(Resource res)
|
boolean |
remove(Resource sub,
Resource super_res)
Tries to remove the link from 'sub' to 'superResource' out of the DAG. |
boolean |
remove(String sub,
String super_res)
|
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Field Detail |
public HashMap dag
Constructor Detail |
public RDF_DAG()
Method Detail |
public ArrayList getorder()
public HashSet getroots()
public ArrayList getloop_element()
public boolean getno_loop()
public HashMap getdag()
public void enter(String sub, String super_res)
public void enter(Resource sub, Resource super_res)
public void enter(Object sub, Object super_res, boolean resource)
public void enter(String s)
public void enter(Resource s)
public boolean remove(Resource sub, Resource super_res)
public boolean remove(String sub, String super_res)
public boolean remove(Resource res)
public boolean remove(Object sub, Object super_res, boolean resource)
public void enumerate()
public boolean loopcheck()
public String output()
public HashSet getLeaves()
public HashSet findRoots()
public HashSet getRelatives(Resource res, int i)
res
- the node referencei
- When it is set to 0 it computes the distinct descendants of the
node. When it is set to 1 computes the distinct ancestorspublic void getAllDescendants(Resource res)
public void getAllAncestors()
|
eRqlEngine API documentation - http://www.wleklinski.de/rdf/ | ||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |