connection_graph.h File Reference

#include <functional>
#include <memory>
#include <mutex>
#include <utility>
#include <vector>
#include <map>
#include <erc/erc_settings.h>
#include <gal/color4d.h>
#include <sch_connection.h>
#include <sch_item.h>
#include <sch_netchain.h>
#include <wx/treectrl.h>
#include <wx/string.h>
#include <advanced_config.h>
#include <progress_reporter.h>

Go to the source code of this file.

Classes
class	CONNECTION_SUBGRAPH
	A subgraph is a set of items that are electrically connected on a single sheet. More...
struct	CONNECTION_SUBGRAPH::CompareConnectionPtr
struct	NET_NAME_CODE_CACHE_KEY
struct	std::hash< NET_NAME_CODE_CACHE_KEY >
class	CONNECTION_GRAPH
	Calculate the connectivity of a schematic and generates netlists. More...
struct	CONNECTION_GRAPH::CHAIN_TERMINAL_REF
struct	CONNECTION_GRAPH::BRIDGE_EDGE
struct	CONNECTION_GRAPH::BRIDGE_NEIGHBOR
struct	CONNECTION_GRAPH::BRIDGE_GRAPH

Namespaces
namespace	std
	STL namespace.

Typedefs
typedef std::unordered_map< NET_NAME_CODE_CACHE_KEY, std::vector< CONNECTION_SUBGRAPH * > >	NET_MAP
	Associate a #NET_CODE_NAME with all the subgraphs in that net.

Typedef Documentation

NET_MAP

typedef std::unordered_map<NET_NAME_CODE_CACHE_KEY, std::vector<CONNECTION_SUBGRAPH*> > NET_MAP

Associate a #NET_CODE_NAME with all the subgraphs in that net.

Definition at line 369 of file connection_graph.h.