LILAC
|
This class puts data into a graph based upon dependencies and performs a topological sort. More...
#include <graph.h>
Classes | |
class | graphnode |
Public Member Functions | |
void | insert (item_wrapper p) |
std::list< item_wrapper > | sort (const std::list< item_wrapper > &l) |
void | insert (item_wrapper p) |
std::list< item_wrapper > | sort (const std::list< item_wrapper > &l) |
Private Member Functions | |
void | ins_extra_deps () |
void | proc_node_deps (graphnode &g) |
graphnode & | _insert (item_wrapper p) |
void | ins_extra_deps () |
void | proc_node_deps (graphnode &g) |
graphnode & | _insert (item_wrapper p) |
Private Attributes | |
std::map< std::string, graphnode > | nodes |
This class puts data into a graph based upon dependencies and performs a topological sort.
|
private |
|
private |
|
private |
|
private |
void graph::insert | ( | item_wrapper | p | ) |
void graph::insert | ( | item_wrapper | p | ) |
|
private |
|
private |
std::list< item_wrapper > graph::sort | ( | const std::list< item_wrapper > & | l | ) |
std::list<item_wrapper> graph::sort | ( | const std::list< item_wrapper > & | l | ) |
|
private |