dalicious ~master (2022-03-10T20:55:15.5110933)
Dub
Repo
Graph.opBinaryRight
dalicious
math
Graph
Check if edge exists in this graph. Only the
start
and
end
node will be compared.
bool
opBinaryRight
(Node node)
bool
opBinaryRight
(Edge edge)
struct
Graph
(Node, Weight = void, Flag!"isDirected" isDirected = No.isDirected, EdgePayload = void)
const pure nothrow
bool
opBinaryRight
(
string
op
)
(
in
Edge
edge
)
if
(
op
== "in"
)
Meta
Source
See Implementation
dalicious
math
Graph
constructors
this
functions
adjacencyList
allDegrees
allIncidentEdges
bulkAddForce
degree
forceAdd
get
has
inDegree
inEdges
incidentEdges
indexOf
opBinaryRight
opOpAssign
outDegree
outEdges
replaceEdge
postblits
this(this)
properties
edges
nodes
static functions
edge
groupByNodes
orderByNodes
static variables
hasEdgePayload
isWeighted
structs
ConflictStrategy
DegreesCache
Edge
IncidentEdgesCache
variables
_edges
_nodes
Check if edge exists in this graph. Only the start and end node will be compared.