NamedGraph (signingframework 1.4 API)

java.lang.Object
- de.uni_koblenz.aggrimm.icp.crypto.sign.graph.NamedGraph

All Implemented Interfaces:

Comparable<NamedGraph>
```
public class NamedGraph
extends Object
implements Comparable<NamedGraph>
```
A named graph is a graph with an IRI as identifier. The graph content is defined by a set of triples (ArrayList) and sub graphs (ArrayList). It can also contain triples in MSGs instead of a direct ArrayList of triples. Each graph has a nesting depth and nested graphs have a parent graph. Named graphs are commonly stored in graph collections (see class 'GraphCollection'). Besides 'normal' named graphs there are two special types (see comment in class GraphCollection).

Author:

Peter Schauß

Constructor Summary

Constructors
Constructor and Description

NamedGraph(String name, int depth, NamedGraph parent)

Constructors
Constructor and Description
`NamedGraph(String name, int depth, NamedGraph parent)`

Method Summary

All Methods Static Methods Instance Methods Concrete Methods Deprecated Methods
Modifier and Type	Method and Description
`void`	`addMSGSignature(String[] data)` Adds a MSG signature to this named graph
`void`	`addTriple(Triple t)` Adds a triple to the graph
`void`	`applyPrefixes(LinkedList<Prefix> pre)` Applies prefixes to a graph and all subgraphs (recursive) - replaces IRIs with prefixes
`int`	`blankNodeCount(boolean recursive, boolean distinct)` Deprecated.
`void`	`clear()` Clears graph by removing all MSGs and sub graphs (recursive)
`int`	`compareTo(NamedGraph g)` Compares graph with another graph (used for sorting, lexicographic order)
`int`	`countDuplicates()` Counts duplicates
`static int`	`countOccurrences(ArrayList<Triple> triples, String node)` Count occurrences of a node (ignores predicates)
`int`	`countPredicate(String predicate)` Counts triples with specified predicate
`LinkedList<NamedGraph>`	`getChildren()`
`int`	`getDepth()`
`String`	`getHierarchyString()` Gets graph hierarchy as string
`ArrayList<MSG>`	`getMSGs()`
`ArrayList<String[]>`	`getMSGSignatures()`
`String`	`getName()`
`NamedGraph`	`getParent()`
`int[]`	`getStats(boolean recursive)` Gets statistics of a named graph (can be recursive to include sub graphs if recursive is set to true) Array index - value 0 - total triple count 1 - IRIs / resources 2 - literals 3 - blank nodes 4 - distinct blank nodes 5 - Unique subject URIs
`static int[]`	`getStatsTripleList(ArrayList<Triple> triples, HashSet<String> blankNodes, HashSet<String> USUs)` Get statistics of a triple list Array index - value 0 - total triple count 1 - IRIs / resources 2 - literals 3 - blank nodes 4 - distinct blank nodes 5 - Unique subject URIs
`ArrayList<Triple>`	`getTriples()`
`ArrayList<NodeHash>`	`getVariableHashes()`
`boolean`	`isHashed()` Checks if hash value for triples in graph is set (recursive) Note: function assumes that either all or no triples are hashed, does not check MSGs
`boolean`	`isUsingMSGs()` Checks if there are any MSGs in the `NamedGraph`
`boolean`	`isValid()` Checks if the graph and all it's content is well-formed
`void`	`mergeMSGs()` Merges all MSGs back to plain triple lists All values associated with MSGs (hash, signature, certificate) will get lost
`void`	`removeTriple(Triple t)` Removes a triple from the graph
`void`	`resolvePrefixes(LinkedList<Prefix> pre)` Resolves prefixes in a graph and all subgraphs (recursive) - replaces prefixes with IRIs
`void`	`setChildren(LinkedList<NamedGraph> children)`
`void`	`setName(String name)`
`void`	`setVariableHashes(ArrayList<NodeHash> variableHashes)`
`void`	`sortGraphs()` Sorts all children graphs by their name (recursive)
`void`	`splitIntoMSGs()` Splits graph into MSGs (recursive)
`String`	`toString()` Converts the graph to a string (used for printing and debugging) Attention: May not work properly with very big named graphs
`String`	`toString(int padding)` Converts the graph to a string (used for printing and debugging) Attention: May not work properly with very big named graphs
`int`	`tripleCount(boolean recursive)` Gets triple count (can be recursive to include all sub graphs)
`void`	`updateDepths(int _depth, NamedGraph _parent)` Updates the depth of this graphs and all sub graphs (recursive)

Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

- Constructor Detail
  - NamedGraph
```
public NamedGraph(String name,
                  int depth,
                  NamedGraph parent)
```
- Method Detail
  - getName
```
public String getName()
```
  - setName
```
public void setName(String name)
```
  - getDepth
```
public int getDepth()
```
  - getTriples
```
public ArrayList<Triple> getTriples()
```
  - getChildren
```
public LinkedList<NamedGraph> getChildren()
```
  - setChildren
```
public void setChildren(LinkedList<NamedGraph> children)
```
  - getParent
```
public NamedGraph getParent()
```
  - getVariableHashes
```
public ArrayList<NodeHash> getVariableHashes()
```
  - setVariableHashes
```
public void setVariableHashes(ArrayList<NodeHash> variableHashes)
```
  - getMSGs
```
public ArrayList<MSG> getMSGs()
```
  - getMSGSignatures
```
public ArrayList<String[]> getMSGSignatures()
```
  - tripleCount
```
public int tripleCount(boolean recursive)
```
    Gets triple count (can be recursive to include all sub graphs)
    
    Parameters:
    
    recursive - count recursively in all sub graphs?
    
    Returns:
    
    triple count
  - blankNodeCount
```
@Deprecated
public int blankNodeCount(boolean recursive,
                                      boolean distinct)
```
    Deprecated.
    
    Gets blank node count
    
    Parameters:
    
    recursive - count recursively in all sub graphs?
    
    distinct - count distinct blank nodes only?
    
    Returns:
    
    blank node count
  - getStats
```
public int[] getStats(boolean recursive)
```
    Gets statistics of a named graph (can be recursive to include sub graphs if recursive is set to true) Array index - value 0 - total triple count 1 - IRIs / resources 2 - literals 3 - blank nodes 4 - distinct blank nodes 5 - Unique subject URIs
    
    Parameters:
    
    recursive - count recursively in all sub graphs?
    
    Returns:
    
    array with statistics
  - getStatsTripleList
```
public static int[] getStatsTripleList(ArrayList<Triple> triples,
                                       HashSet<String> blankNodes,
                                       HashSet<String> USUs)
```
    Get statistics of a triple list Array index - value 0 - total triple count 1 - IRIs / resources 2 - literals 3 - blank nodes 4 - distinct blank nodes 5 - Unique subject URIs
    
    Parameters:
    
    triples - triples to get stats from
    
    blankNodes - list of detected blank nodes
    
    USUs - list of detected USUs (unique subject URIs)
    
    Returns:
    
    array with statistics
  - countPredicate
```
public int countPredicate(String predicate)
```
    Counts triples with specified predicate
    
    Parameters:
    
    predicate - URI of the predicate
    
    Returns:
    
    number of occurrences
  - countDuplicates
```
public int countDuplicates()
```
    Counts duplicates
    
    Returns:
    
    number of duplicates
  - countOccurrences
```
public static int countOccurrences(ArrayList<Triple> triples,
                                   String node)
```
    Count occurrences of a node (ignores predicates)
    
    Parameters:
    
    triples - ArrayList of triples to scan
    
    node - node value to count
    
    Returns:
    
    number of occurrences of node in subject/object position
  - sortGraphs
```
public void sortGraphs()
```
    Sorts all children graphs by their name (recursive)
  - getHierarchyString
```
public String getHierarchyString()
```
    Gets graph hierarchy as string
    
    Returns:
    
    graph hierarchy string
  - addTriple
```
public void addTriple(Triple t)
```
    Adds a triple to the graph
    
    Parameters:
    
    t - triple to add
  - removeTriple
```
public void removeTriple(Triple t)
```
    Removes a triple from the graph
    
    Parameters:
    
    t - triple to remove
  - resolvePrefixes
```
public void resolvePrefixes(LinkedList<Prefix> pre)
```
    Resolves prefixes in a graph and all subgraphs (recursive) - replaces prefixes with IRIs
    
    Parameters:
    
    pre - ArrayList with prefixes
  - applyPrefixes
```
public void applyPrefixes(LinkedList<Prefix> pre)
```
    Applies prefixes to a graph and all subgraphs (recursive) - replaces IRIs with prefixes
    
    Parameters:
    
    pre - ArrayList with prefixes
  - splitIntoMSGs
```
public void splitIntoMSGs()
```
    Splits graph into MSGs (recursive)
  - mergeMSGs
```
public void mergeMSGs()
```
    Merges all MSGs back to plain triple lists All values associated with MSGs (hash, signature, certificate) will get lost
  - isHashed
```
public boolean isHashed()
```
    Checks if hash value for triples in graph is set (recursive) Note: function assumes that either all or no triples are hashed, does not check MSGs
    
    Returns:
    
    true if hash value is set, false otherwise
  - isUsingMSGs
```
public boolean isUsingMSGs()
```
    Checks if there are any MSGs in the NamedGraph
    
    Returns:
    
    true if there are MSGs, false otherwise
  - addMSGSignature
```
public void addMSGSignature(String[] data)
```
    Adds a MSG signature to this named graph
    
    Parameters:
    
    data - signature data
  - isValid
```
public boolean isValid()
                throws Exception
```
    Checks if the graph and all it's content is well-formed
    
    Returns:
    
    true if its well-formed
    
    Throws:
    
    Exception - if its malformed
  - clear
```
public void clear()
```
    Clears graph by removing all MSGs and sub graphs (recursive)
  - updateDepths
```
public void updateDepths(int _depth,
                         NamedGraph _parent)
```
    Updates the depth of this graphs and all sub graphs (recursive)
  - toString
```
public String toString()
```
    Converts the graph to a string (used for printing and debugging) Attention: May not work properly with very big named graphs
    
    Overrides:
    
    toString in class Object
    
    Returns:
    
    string representation
  - toString
```
public String toString(int padding)
```
    Converts the graph to a string (used for printing and debugging) Attention: May not work properly with very big named graphs
    
    Parameters:
    
    padding - indention level
    
    Returns:
    
    string representation
  - compareTo
```
public int compareTo(NamedGraph g)
```
    Compares graph with another graph (used for sorting, lexicographic order)
    
    Specified by:
    
    compareTo in interface Comparable<NamedGraph>
    
    Parameters:
    
    g - graph to compare this graph with
    
    Returns:
    
    0 if g is equal, >0 if g is bigger, 0< if g is smaller

Class NamedGraph

Constructor Summary

Method Summary

Methods inherited from class java.lang.Object

Constructor Detail

NamedGraph

Method Detail

getName

setName

getDepth

getTriples

getChildren

setChildren

getParent

getVariableHashes

setVariableHashes

getMSGs

getMSGSignatures

tripleCount

blankNodeCount

getStats

getStatsTripleList

countPredicate

countDuplicates

countOccurrences

sortGraphs

getHierarchyString

addTriple

removeTriple

resolvePrefixes

applyPrefixes

splitIntoMSGs

mergeMSGs

isHashed

isUsingMSGs

addMSGSignature

isValid

clear

updateDepths

toString

toString

compareTo