resonance 1.0.1
Loading...
Searching...
No Matches
netflow.h
Go to the documentation of this file.
1#ifndef NETFLOW_NETFLOW_H
2#define NETFLOW_NETFLOW_H
3
14
15#ifdef __cplusplus
16extern "C" {
17#endif
18
20enum { NETFLOW_MAX_VERTICES = 2500 };
21
25 int v;
26};
27
34
41
47
55void Init_U(struct netflow_graph *graph);
56
64void Init_V(struct netflow_v_side *side);
65
79void AddEdge(int u, int v, struct netflow_graph *graph, struct netflow_v_side *side);
80
92void Match(struct netflow_graph *graph, struct netflow_v_side *side);
93
94#ifdef __cplusplus
95}
96#endif
97
98#endif
void AddEdge(int u, int v, struct netflow_graph *graph, struct netflow_v_side *side)
Add an edge from a U vertex to a V vertex.
void Init_U(struct netflow_graph *graph)
Clear every adjacency list and mate of a graph, and its U count.
void Init_V(struct netflow_v_side *side)
Clear every mate of a V set, and its V count.
void Match(struct netflow_graph *graph, struct netflow_v_side *side)
Find a maximum matching of graph against side.
@ NETFLOW_MAX_VERTICES
Definition netflow.h:20
One edge in the adjacency list of a U vertex.
Definition netflow.h:23
struct netflow_edge * next
Definition netflow.h:24
int v
Definition netflow.h:25
The U set and its adjacency lists.
Definition netflow.h:36
int u_count
Definition netflow.h:38
int edge_count
Definition netflow.h:39
struct netflow_u_vertex u[NETFLOW_MAX_VERTICES]
Definition netflow.h:37
One vertex of the U set.
Definition netflow.h:29
struct netflow_edge * edges
Definition netflow.h:30
struct netflow_edge * cursor
Definition netflow.h:31
int mate
Definition netflow.h:32
The V set.
Definition netflow.h:43
int v_count
Definition netflow.h:45
int mate[NETFLOW_MAX_VERTICES]
Definition netflow.h:44