Modifier and Type | Interface and Description |
---|---|
interface |
Edge |
interface |
Property |
interface |
Relationship |
Modifier and Type | Method and Description |
---|---|
Node |
Graph.createNode() |
Node |
Relationship.getEnd() |
Node |
Relationship.getOtherNode(Node n) |
Node |
Edge.getStart() |
Modifier and Type | Method and Description |
---|---|
Collection<? extends Node> |
Edge.getNodes() |
Iterable<? extends Node> |
Graph.getNodeSnapshot() |
Set<Node> |
Graph.getNodeSnapshotByAttribute(String propertyType,
Object attribute) |
Modifier and Type | Method and Description |
---|---|
Relationship |
Node.createRelationship(String type,
Node n) |
Node |
Relationship.getOtherNode(Node n) |
boolean |
Edge.isIncidentOn(Node n) |
boolean |
Relationship.isSelfLoop(Node node) |
Modifier and Type | Class and Description |
---|---|
class |
MemoryEdge |
class |
MemoryNode |
class |
MemoryProperty |
class |
MemoryRelationship |
Modifier and Type | Method and Description |
---|---|
Node |
MemoryGraph.createNode() |
Node |
MemoryRelationship.getEnd() |
Node |
MemoryRelationship.getOtherNode(Node n) |
Node |
MemoryEdge.getStart() |
Modifier and Type | Method and Description |
---|---|
Collection<? extends Node> |
MemoryRelationship.getNodes() |
Collection<? extends Node> |
MemoryProperty.getNodes() |
Iterable<? extends Node> |
MemoryGraph.getNodeSnapshot() |
Set<Node> |
MemoryGraph.getNodeSnapshotByAttribute(String propertyType,
Object attribute) |
Modifier and Type | Method and Description |
---|---|
Relationship |
MemoryNode.createRelationship(String type,
Node n) |
Relationship |
MemoryProperty.createRelationship(String type,
Node n) |
Node |
MemoryRelationship.getOtherNode(Node n) |
boolean |
MemoryRelationship.isIncidentOn(Node n) |
boolean |
MemoryProperty.isIncidentOn(Node n) |
boolean |
MemoryRelationship.isSelfLoop(Node node) |
Modifier and Type | Method and Description |
---|---|
List<List<Node>> |
Partitioner.partition(Graph g,
Iterable<? extends Node> nodes,
RelationshipWeighter rweight)
Partition the set of nodes into the specified number of blocks aiming to minimize the edge
cut as specified by the RelationshipWeighter.
|
Modifier and Type | Method and Description |
---|---|
List<List<Node>> |
Partitioner.partition(Graph g,
Iterable<? extends Node> nodes,
RelationshipWeighter rweight)
Partition the set of nodes into the specified number of blocks aiming to minimize the edge
cut as specified by the RelationshipWeighter.
|
double |
Partitioner.partition(Graph g,
Iterable<? extends Node> nodes,
RelationshipWeighter rweight,
List<? extends Collection<Node>> partition)
Partition the set of nodes into the specified number of blocks aiming to minimize the edge
cut as specified by the RelationshipWeighter.
|
double |
Partitioner.partition(Graph g,
Iterable<? extends Node> nodes,
RelationshipWeighter rweight,
List<? extends Collection<Node>> partition)
Partition the set of nodes into the specified number of blocks aiming to minimize the edge
cut as specified by the RelationshipWeighter.
|
Modifier and Type | Method and Description |
---|---|
List<List<Node>> |
HierarchicalPartitioning.partition(Graph g,
Iterable<? extends Node> nodes,
RelationshipWeighter rweight) |
Modifier and Type | Method and Description |
---|---|
protected static HashRelationshipWeighter |
HierarchicalPartitioning.createCoarseGraph(Graph g,
Iterable<org.linqs.psl.utils.graph.partition.hierarchical.SuperNode> supernodes,
Map<Node,org.linqs.psl.utils.graph.partition.hierarchical.SuperNode> assign,
RelationshipWeighter rweight) |
List<List<Node>> |
HierarchicalPartitioning.partition(Graph g,
Iterable<? extends Node> nodes,
RelationshipWeighter rweight) |
double |
HyperPartitioning.partition(Graph g,
Iterable<? extends Node> nodes,
RelationshipWeighter rweight,
List<? extends Collection<Node>> partition) |
double |
HyperPartitioning.partition(Graph g,
Iterable<? extends Node> nodes,
RelationshipWeighter rweight,
List<? extends Collection<Node>> partition) |
double |
HierarchicalPartitioning.partition(Graph g,
Iterable<? extends Node> nodes,
RelationshipWeighter rweight,
List<? extends Collection<Node>> partition) |
double |
HierarchicalPartitioning.partition(Graph g,
Iterable<? extends Node> nodes,
RelationshipWeighter rweight,
List<? extends Collection<Node>> partition) |
double |
HyperPartitioning.partition(Graph g,
Iterable<? extends Node> nodes,
RelationshipWeighter rweight,
NodeWeighter nweight,
List<? extends Collection<Node>> partition) |
double |
HyperPartitioning.partition(Graph g,
Iterable<? extends Node> nodes,
RelationshipWeighter rweight,
NodeWeighter nweight,
List<? extends Collection<Node>> partition) |
double |
HierarchicalPartitioning.partition(Graph g,
Iterable<? extends Node> nodes,
RelationshipWeighter rweight,
NodeWeighter nweight,
List<? extends Collection<Node>> partition) |
double |
HierarchicalPartitioning.partition(Graph g,
Iterable<? extends Node> nodes,
RelationshipWeighter rweight,
NodeWeighter nweight,
List<? extends Collection<Node>> partition) |
Modifier and Type | Method and Description |
---|---|
double |
ConstantOneNodeWeighter.getWeight(Node n) |
double |
PropertyNodeWeighter.getWeight(Node n) |
double |
NodeWeighter.getWeight(Node n) |
Copyright © 2018 University of California, Santa Cruz. All rights reserved.