grammarscope.common.utils

Class EdgeSort<T>

java.lang.Object

grammarscope.common.utils.EdgeSort<T>

public final class EdgeSort<T>
extends java.lang.Object

Order nodes

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	EdgeSort.EdgeSpanComparator Edge comparator based on span
static class	EdgeSort.RelationComparator Edge comparator based on relation

Constructor Summary

Constructors

Modifier	Constructor and Description
private	EdgeSort()

Method Summary

Modifier and Type	Method and Description
static java.util.List<GraphEdge>	sort(Graph<GraphNode,GraphEdge> graph, RelationFilter relationFilter) Sort edges per span
static java.util.List<GraphEdge>	sortPerNode(Graph<GraphNode,GraphEdge> graph, RelationFilter relationFilter) Order edges per node
static java.util.List<GraphEdge>	sortPerRelation(Graph<GraphNode,GraphEdge> graph, RelationFilter relationFilter)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

EdgeSort

private EdgeSort()

Method Detail

sort

public static java.util.List<GraphEdge> sort(Graph<GraphNode,GraphEdge> graph,
                                             RelationFilter relationFilter)

Sort edges per span

Parameters:

graph - graph

relationFilter - relation filter

Returns:

sorted edges

sortPerNode

public static java.util.List<GraphEdge> sortPerNode(Graph<GraphNode,GraphEdge> graph,
                                                    RelationFilter relationFilter)

Order edges per node

Parameters:

graph - graph

relationFilter - relation filter

Returns:

sorted edges

sortPerRelation

public static java.util.List<GraphEdge> sortPerRelation(Graph<GraphNode,GraphEdge> graph,
                                                        RelationFilter relationFilter)